N-Queens Puzzle All Solutions for N=4 to N=12

The n-queens puzzle is a nineteenth century problem that involves placing n queens on a n by n chessboard with no two or more queens attacking one another. The queen in chess can move diagonally, horizontally, or vertically any number of squares. This app finds all the solutions.

C# (173.1 KB)
 
 
 
 
 
(0)
191 times
Add to favorites
6/9/2015
E-mail Twitter del.icio.us Digg Facebook

Solution explorer

C#
Click an item in the panel on the left to view the contents here.