A method for finding Hamilton paths and Knight's tours

DOI10.1145/363427.363463zbMath1398.05117OpenAlexW1988318499WikidataQ56069812 ScholiaQ56069812MaRDI QIDQ4962337

I. Pohl

Publication date: 2 November 2018

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/363427.363463

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items

A practical approach to the chromatic partition problem, Taming the knight's tour: minimizing turns and crossings