|
|
Knight's Tour Game
-
Version
1.2.5
Knight's Tour Game is a sequence of moves of a knight
on a chessboard such that the knight visits every
square only once. The knight's tour problem is the
mathematical problem of finding a knight's tour.
Knight's graph showing all possible paths for a
knight's tour on a 9¡Á9 chessboard. You start from any
cell of the grid, and then you make an "L" shaped move
from the previous one. And then it goes like this,
move after move, until you fill all the cells, or
you're stuck.
|