Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01780547n
Noun Concept
Categories: Mathematical chess problems, Computational problems in graph theory
EN
Longest uncrossed knight's path  Longest nonintersecting knight's path  Longest uncrossed knight path
EN
The longest uncrossed knight's path is a mathematical problem involving a knight on the standard 8×8 chessboard or, more generally, on a square n×n board. Wikipedia
Definitions
Relations
Sources
EN
The longest uncrossed knight's path is a mathematical problem involving a knight on the standard 8×8 chessboard or, more generally, on a square n×n board. Wikipedia
IS A
mathematical chess problem
Wikipedia
EN
Longest uncrossed knight's path
Wikidata
EN
Longest uncrossed knight's path
Wikipedia Redirections
EN
Longest nonintersecting knight's path, Longest uncrossed knight path

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