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.
2013
2013
The challenge of steganographic methods is to create a rational balance between the quality of the file and the size of data that… 
2010
2010
A multi-scale triangular mapping and its inverse mapping are presented. Combined with an mton mapping, scrambling method based on… 
2008
2008
Recursion is a powerful technique used to solve problems with repeating patterns, and is a fundamental structure in software. To… 
2007
2007
A closed knight's tour of a chessboard uses legal moves of the knight to visit every square exactly once and return to its… 
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… 
1994
1994
~trak: Satu kajian awalan ke atas komposisi spesies semut isi rumah di Pulau Pinang, Malaysia telah dijalankan. Empat lokasi yang… 
Highly Cited
1988