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.
2020
2020
Abstract This paper aims to propose a method for data hiding in video by utilizing the least significant bit (LSB) method and… 
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… 
Highly Cited
2009
Highly Cited
2009
  • Yavuz Erdogan
  • British Journal of Educational Technology
  • 2009
  • Corpus ID: 2379491
The purpose of this paper is to compare the effects of paper-based and computer-based concept mappings on computer hardware… 
Review
2009
Review
2009
A method for etching polysilicon or polycide gate electrodes over thin gate oxides is described wherein the problem of pitting… 
2007
2007
  • J. DeMaio
  • Electronic Journal of Combinatorics
  • 2007
  • Corpus ID: 2046574
A closed knight's tour of a chessboard uses legal moves of the knight to visit every square exactly once and return to its… 
Highly Cited
1999
Highly Cited
1999
Three experimental studies were conducted to examine two alternative explanations for the widely established positive eAect of… 
Highly Cited
1988
Highly Cited
1988