In knight tour (kt) problem every chess square is visited exactly once using knight moves. In this game some knight moves already made and we have an incomplete kt. The object is to complete the kt by guessing missing moves.
License
GNU General Public License version 2.0 (GPLv2)Follow xknight
Other Useful Business Software
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of xknight!