4x4 Knight's tour C program
Posted on 2004-03-25
given a 4x4 chess board with the knight initially on row 0, column 1 (i.e. second block from left), construct a depth-first iterative deepining algorithm (C language) to solve the following: The Knight has to visit all the blocks except the top left corner (i.e. ).