Department
Mathematics
Document Type
Article
Publication Date
6-2009
Abstract
A closed knight's tour of a chessboard uses legal moves of the knight to visit every square exactly once and return to its starting position. In 1991 Schwenk completely classified the rectangular chessboards that admit a closed knight's tour. For a rectangular chessboard that does not contain a closed knight's tour, this paper determines the minimum number of squares that must be removed in order to admit a closed knight's tour. Furthermore, constructions that generate a closed tour once appropriate squares are removed are provided.
Journal Title
Mathematics Magazine
Journal ISSN
0025-570X
Volume
82
Issue
3
First Page
219
Last Page
225