Optimization Online


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

Michael Firstein (michaelfir***at***edu.aau.at)
Anja Fischer (anja.fischer***at***mathematik.uni-goettingen.de)
Philipp Hungerländer (philipp.hungerlaender***at***aau.at)

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 5^0.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 5^0.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.

Category 1: Combinatorial Optimization

Citation: Technical report, Alpen-Adria Universität Klagenfurt, Mathematics, Optimization Group, TR-AAUK-M-O-23-07-17, 2017.

Download: [PDF]

Entry Submitted: 07/22/2017
Entry Accepted: 08/01/2017
Entry Last Modified: 11/18/2017

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society