Knight’s Tour is a classical problem on the chess board. In this, a knight is moved in sequence of squares such that it visits every squares exactly once. This problem is most often dealt as mathematical problem and a most popular problem appearing in Artificial Intelligence. Knight’s Tour is a more general form of Hamiltonian path problem. And this project appeared as project for subject - Artificial Intelligence.

Technology used: Artifiial Intelligence, Warnsdorf's rule

Share with your friends

Knight's Tour's Screenshot

Team Members


Post Your Comment

Please Login to Comment