/EulerKnight

Euler Knight Tour Problem @IUT-NC 2019 | Java program to find 1 & the number of possible solutions.

Primary LanguageJava

EulerKnight Complete Tour Recursive Bruteforce way

The script Cavalier.java try to find one solution for the start pos and the size given.

Example:

java Cavalier 0 0 5

Returns the representation of the chessboard with a valid solution starting from the position 0,0

java Cavalier 1 2 5

Returns No Solutions found

The script CavalierALL.java try to find the number of valid solutions for the start pos and the size given.

java CavalierALL 0 0 5

Returns 304