Skip to search formSkip to main contentSkip to account menu

Knight's tour

Known as: H. C. Warnsdorff, Schwenk's theorem, Knights tour 
A knight's tour is a sequence of moves of a knight on a chessboard such that the knight visits every square only once. If the knight ends on a square… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
A knight's tour on a board is a sequence of knight moves that visits each square exactly once. A knight's tour on a square board… 
2010
2010
A multi-scale triangular mapping and its inverse mapping are presented. Combined with an mton mapping, scrambling method based on… 
2010
2010
The scrambling algorithm based on knight-tour transform is a hot topic because the number of its secret key is large and its… 
2008
2008
Recursion is a powerful technique used to solve problems with repeating patterns, and is a fundamental structure in software. To… 
2007
2007
PCT No. PCT/US79/00667 Sec. 371 Date Aug. 30, 1979 Sec. 102(e) Date Aug. 30, 1979 PCT Filed Aug. 30, 1979 PCT Pub. No. WO81/00598… 
2004
2004
This paper presents three heuristic functions that aim to reduce the search cost for the knight tour problem. The first heuristic… 
2003
2003
Field performance of a 0.5% methoprene-based granular bait (Protect-B) was evaluated against foraging Pharaoh ants, Monomorium… 
Highly Cited
1988