THE KNIGHTS TOUR
This is considered to be one of the toughest probles.
IT is a sequence of moves of a knight on achessboard such that the knight visits every square exactly once. If the knight ends on a square that is one knight's move from the beginning square (so that it could tour the board again immediately, following the same path), the tour isclosed, otherwise it is open. The exact number of open tours on an 8x8 chessboard is still unknown
.
The knight's tour problem is the mathematical problem of finding a knight's tour. Creating a program to find a knight's tour is a common problem given to computer science students. Variations of the knight's tour problem involve chessboards of different sizes than the usual 8 × 8, as well as irregular (non-rectangular) boards
the solution is here if u are a good video learner.
the solution is here if u are a good video learner.
and the solution is to be found out as
No comments:
Post a Comment