SolveNQueens is my own approach to the solution of the popular N Queens problem. The N Queens problem is a mathematical problem roughly formulated as:
“How many ways are there to place N Queens on an NxN chess board so that none of them can capture each other?”
Download it from here:
You may read more about the N Queens problem on Wikipedia. Also, I advice you to check out Jeff Somers’ excellent webpage on this topic. His source code follows a different approach than mine, but also works much faster for bigger board sizes.
You may use the solveNQueens source code freely, under any license that you wish to use. The inspiration for this, by the way, came from one of the excellent Professor Layton games for the Nintendo DS.