Closed Almost Knight’s Tours on 2D and 3D Chessboards

Michael Firstein (), Anja Fischer () and Philipp Hungerländer ()
Additional contact information
Michael Firstein: Alpen-Adria-Universität Klagenfurt
Anja Fischer: Georg-August-Universität Göttingen
Philipp Hungerländer: Alpen-Adria-Universität Klagenfurt

A chapter in Operations Research Proceedings 2017, 2018, pp 185-190 from Springer

Abstract: Abstract Let a (generalized) chessboard in two or three dimensions be given. A closed knight’s tour is defined as a Hamiltonian cycle over all cells of the chessboard where all moves are knight’s moves, i. e. have length $$\sqrt{5}$$ . It is well-characterized for which chessboard sizes it is not possible to construct a closed knight’s tour. On such chessboards a closed almost knight’s tour is defined as a Hamiltonian cycle of minimal length if only moves of length at least $$\sqrt{5}$$ are allowed. The problem of determining closed (almost) knight’s tours on 2D and 3D chessboards is equivalent to the so called traveling salesman problem with forbidden neighborhoods on regular 2D and 3D grids if the radius of the forbidden neighborhood is two and hence the minimal feasible distance of two consecutive vertices in the tour equals the length of a knight’s move. In this paper we present explicit construction schemes for closed almost knight’s tours by extending ideas used for the construction of knight’s tours.

Keywords: Knight’s tour problem; Traveling salesman problem; Forbidden neighborhood (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-319-89920-6_26

Ordering information: This item can be ordered from
http://www.springer.com/9783319899206

DOI: 10.1007/978-3-319-89920-6_26

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().