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.
Release Date:
Topics:
License:
Operating System:
Intended Audience:
User Interface:
Database Environment:
Programming Language:
Registered:
Ratings and Reviews
Be the first to post a text review of xknight. Rate and review a project by clicking thumbs up or thumbs down in the right column.
Project Feed
-
xknight xknight 0.1 file released: xknight.py
If you changed it please don't forget to distribute it.
-
xknight xknight 0.1 file released: xknight.tar.gz
If you changed it please don't forget to distribute it.
-
xknight xknight 0.1 file released: kt.py
If you changed it please don't forget to distribute it.
-
xknight xknight 0.1 file released: ktour_dic.py
If you changed it please don't forget to distribute it.
-
File released: /xknight/xknight 0.1/xknight.py
-
File released: /xknight/xknight 0.1/xknight.tar.gz
-
File released: /xknight/xknight 0.1/ktour_dic.py
-
File released: /xknight/xknight 0.1/kt.py
Rate and Review
Be the first person to add a text review.
Related Projects
-
MyGame.Sokudo
Same as Sokudo rule:Fill in the game board so that the numbers 1 through 9 occur exactly once in each row, column, and 3x3 box(we call it RULE). The numbers can appear in any order and diagonals are not considered.Base on Win32SDK, code with C++
-
xknight Actions
About SourceForge
Develop Software
Copyright © 2009 Geeknet, Inc. All rights reserved. Terms of Use
