Various algorithms solving the knight's tour problem. Written in Java. Supports multithreaded solving.
- Java 8
- Gradle
- IntelliJ IDEA (Project Files included)
- Backtracking
--method backtracking - Backtracking with random tiebreak
--method backtracking-random - Warnsdorff's Rule
--method warnsdorf
Run gradle build inside root folder.
JKnight [options]
Options:
--algorithm
Solving algorithm: warnsdorf, backtracking, backtracking-random
Default: warnsdorf
--board
Rows and columns of the board: e.g. --board 8 8
--help
Display Help
Default: false
--solutions
Number of attempted solutions, -1 = unlimited
Default: -1
--start
Start position of the knight: e.g. --start 4 4
--threads
Number of knights and threads
Default: 1
Copyright © 2017 Stefan Kerkmann. This software released under the MIT License.