Schwenk (1991).Which Rectangular Chessboards Have a Knight’s Tour? Mathematics Magazine, 64, 325–332

· 1991 · arXiv 1991.119776

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

representative citing papers

cs.DM · 2026-06-28 · unverdicted · novelty 6.0

Knight's Tour is NP-hard on connected boards; optimal Knight Exchange is NP-hard by polynomial-time reduction from the tour problem.

Showing 1 of 1 citing paper after filters.

The Optimal Knight Exchange Puzzle is NP-Hard cs.DM · 2026-06-28 · unverdicted · none · ref 1
Knight's Tour is NP-hard on connected boards; optimal Knight Exchange is NP-hard by polynomial-time reduction from the tour problem.