This is a basic Java program demonstrating the "Knight's Tour". The Knight's Tour problem is to find a single path starting from any position on a chessboard where a knight chess piece will visit all squares without visiting any single square more than once. My implementation uses Warnsdorf's Rule in order to solve the problem.
This is a basic Java program demonstrating the "Knight's Tour". The Knight's Tour problem is to find a single path starting from any position on a chessboard where a knight chess piece will visit all squares without visiting any single square more than once. My implementation uses Warnsdorf's Rule in order to solve the problem.