**>
ABOUT ME**** ****>RESUME**** ****>LINKS I LIKE**** >MAIN PAGE****>GUESTBOOK**

( Click on the underlined heading above to see the C / C++ program code . )

The aim is to move the Knight , to touch each square of the Chessboard , only once . The problem can be

solved using either the Accessibility / Warsndorff Heuristic or using Hamiltonian Cycles from Graph theory .

My C program is based on the Accessibility heuristic . The Knight is first moved to the square which

is accessible from the least number of squares . This heuristic is known to work uptil a 76x76 Chessboard .

My program is written only for an 8 x 8 chessboard .

c .