Longest Uncrossed Knight's Path Article Index for
Longest
Shopping
Longest
Website Links For
Longest
 

Information About

Longest Uncrossed Knight's Path









Solutions are known only up to ''n'' = 8. The length of the longest path, whether open or closed (), for ''n'' = 3…8 is:
:2, 5, 10, 17, 24, 35.
These results can readily be reproduced by a simple Backtracking computer program. However, the running time for such a program becomes prohibitively long for ''n'' ≥ 9.

The problem can be further generalized to rectangular ''n'' × ''m'' boards, or even to boards in the shape of any Polyomino . Other Standard Chess Piece s than the knight are less interesting, but Fairy Chess Piece s like camel, giraffe and zebra lead to problems of comparable complexity.


SEE ALSO

  • A Knight's Tour is a self-intersecting knight's path visiting all fields of the board.

  • TwixT , a board game based on uncrossed knight's paths.



REFERENCES

  • L. D. Yarbrough, Uncrossed knight's tours, ''Journal of Recreational Mathematics'' 1 (1969), no. 3, pp. 140-142.



EXTERNAL LINKS