Backtracking for the N-Queens Problem Yet Again

This application uses a brute force permutation based n-queens solver and a chrnonological backtracking solver to find all the solutions to the n-queens problem for a specified n such that 4<=n<=10. The user can print the whole n! search space and/or the solutions of the problem

C# (186.0 KB)
 
 
 
 
 
(0)
449 times
Add to favorites
10/16/2015
E-mail Twitter del.icio.us Digg Facebook