veysiertekin/knights-tour

A complete solution with heuristic & non-heuristic ways to knights-tour problem in chess

Knights-tour

This project was created as an Ecipse Project during my AI class.

You can find more detail about the actual problem here: Knight's tour

• Seperately, two solution of this problem was implemented
  1. Depth-first search (aka a blind search algorithm)
  2. Warnsdorff's Rule (aka a heuristic algorithm)

If i have time, i will implement to i18n version but if you contribute to project, you're welcome.

(1) After establishing a knight via mouse' click


(2) After resolving problem [Ctrl+F](shows estimated time)


(3) Knight automatically processes on the board via play button


(4) Final state