Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01780547n
Noun Concept
EL
No term available
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
Relations
Sources
IS A
EN
mathematical chess problem

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