A Java implementation of the Knight's Tour algorithm. The knight's tour problem is the mathematical problem of finding a knight's tour. Creating a program to find a knight's tour is a challenge given to computer science students.

• Download Project (.jar | 233 KB)
• Download Java Runtime Environment (Direct Link)

• Download Project Proposal (.pdf | 401 KB)
• Download Keynote (.pdf | 7 MB)

• Developed a user interface within the Java GUI Application using NetBeans IDE components such as TextBox, Label, Buttons, Table, MessageBox, etc.
• Integrated Warnsdorff's rule algorithm to the program. (Wikipedia)

• Add an ability to customize a different sizes chessboards.
• Implement other algorithms such as Brute-force algorithm, Common backtracking algorithm, Divide and conquer algorithms, etc.
• Improve performance and reliability.

Licensed under The MIT License. You could use the source code for whatever you want as long as the LICENSE file or the license header in the source code still there.

All reading materials from this repository is licensed under CC BY 4.0. You could use this repository as your reference as long as you give the attribution.

Copyright © 2018 Wutipat Khamnuansin, All rights reserved.