Knight's Tour is a famous Data Structure and Algorithms problem. It test your ability to you think recursive and furthers the understanding of backtracking. There are 2 files both use recursive ways and backtracking to find the solution of the Knight's Tour problems. The Ktour.java file solves the Knight's Tour problem with only If Statements. The KnightTour.java file uses for loop to solve the problem.
ammist07/KnightsTour
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|