Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03103414n
Noun Concept
Categories: Graph algorithms, Hamiltonian paths and cycles, Chess problems, Mathematical problems, Mathematical chess problems
EN
knight's tour  Knight Tour  H. C. Warnsdorff  Knight tours  Knights tour
EN
A knight's tour is a sequence of moves of a knight on a chessboard such that the knight visits every square exactly once. Wikipedia
Definitions
Relations
Sources
EN
A knight's tour is a sequence of moves of a knight on a chessboard such that the knight visits every square exactly once. Wikipedia
Sequence of moves of a knight on a chessboard to visit each square exactly once Wikidata
A sequence of positions on a chessboard, which sequence includes each square precisely once, and where successive positions are a knight's move away from one another. Wiktionary
IS A
mathematical chess problem
Hamiltonian path problem
chess puzzle
STUDIED BY
graph theory
Wikipedia
EN
knight's tour
Wikidata
EN
Knight's tour
Wiktionary
EN
knight's tour
Wikipedia Redirections
EN
H. C. Warnsdorff, Knight's Tour, Knight tour, Knight Tour, Knight tours, Knights tour, Kâvyâlankâra, Schwenk's theorem, the knight's tour, Warnsdorff's algorithm, Warnsdorff's rule

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License