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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Conrad, A., Hindrichs, T., Hussein, M., & Wegener, I. (1994). Solution of the knight’s Hamiltonian path problem on chessboards. Discrete Applied Mathematics, 50(2), 125–134.
Dantzig, G., Fulkerson, R., & Johnson, S. (1954). Solution of a large-scale traveling-salesman problem. Operations Research, 2, 393–410.
DeMaio, J., & Mathew, B. (2011). Which chessboards have a closed knight’s tour within the rectangular prism?. The Electronic Journal of Combinatorics18.
Erde, J., Golénia, B., Golénia, S. (2012). The closed knight tour problem in higher dimensions. The Electronic Journal of Combinatorics, 16(4).
Fischer, A., & Hungerländer, P. (2017). The traveling salesman problem on grids with forbidden neighborhoods. Journal of Combinatorial Optimization.
Lin, S., & Wei, C. (2005). Optimal algorithms for constructing knight’s tours on arbitrary \(n \times m \) chessboards. Discrete Applied Mathematics, 146, 219–232.
Schwenk, A. J. (1991). Which rectangular chessboards have a knight’s tour? Mathematics Magazine, 64(5), 325–332.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Firstein, M., Fischer, A., Hungerländer, P. (2018). Closed Almost Knight’s Tours on 2D and 3D Chessboards. In: Kliewer, N., Ehmke, J., Borndörfer, R. (eds) Operations Research Proceedings 2017. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-89920-6_26
Download citation
DOI: https://doi.org/10.1007/978-3-319-89920-6_26
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-89919-0
Online ISBN: 978-3-319-89920-6
eBook Packages: Business and ManagementBusiness and Management (R0)