KNIGHT'S TOUR PROBLEM

Please note that the material on this website is not intended to be exhaustive.
This is intended as a summary and supplementary material to the required textbook.

Given:

• one chess knight piece
• 8 x 8 chess board

Objective:

• To find all possible ways of placing a knight on a chess board
• such that a knight "visits" each square on the chess board once and only once

For example, see the following for a preview by clicking on:   Preview of Knight's Tour

Problem:   To solve the Knight's Tour problem, start by superimposing the chess board on a cartesian coordinate plane.

Figure 87: Chess Board and Cartesian Coordinate Plane Superimposed

Observe that if a knight is located at a given coordinate ( x, y ), its possible moves are as follows:

Figure 88: Knight's Moves

Problem:   Develop a recursive algorithm for solving the Knight's Tour.

---

© 1994.07.23 cpsm ; last update 2012-01-08 0:21

---