The longest uncrossed (or nonintersecting) knight's path is a mathematical problem involving a knight on the standard 8×8 chessboard or, more generally...

duality relation between longest paths and graph coloring Longest uncrossed knight's path Snake-in-the-box, the longest induced path in a hypercube graph...

general Hamiltonian path problem, the knight's tour problem can be solved in linear time. The earliest known reference to the knight's tour problem dates...

1007/978-3-319-09165-5_15. Dominic Mazzoni; Kevin Watkins (October 1997). "Uncrossed knight paths is NP-complete". "Mark Thompson's TwixT webpage". Archived from...