Solving the NQueens problem – version 2

1 Comment

At last, after almost three months since my first post, I have manage to have a constraint programming solver that is able to solve the nqueens problem. You can find the application here http://cpnqueens.appspot.com/

screenshot of the nqueens solver web application, version 2

The n queens puzzle is the problem of placing n chess queens on an n×n chessboard so that no two queens attack each other. The puzzle has been studied over the years by many mathematicians, including Gauss. The number of distinct known solutions for placing n queens on an n × n board are sequenced in OEIS’s sequence A000170.

Motivations to write this blog

Leave a comment

I have moved recently to London and I am starting to realize that I have much more free time that I was used to have. So, I have decided to dedicate some of this time to blog about things that interest me. I guess I will post random thoughts in general, however the idea is to dedicate most of the posts to write about software solvers.

There are two reasons for having chosen software solvers; first, software solver technology is one of the closest approaches computer science has yet made to develop some kind of “working” AI technology. And this technology with all the mathematical foundation behind it is fascinating. Second, I am working for the IT industry and I think that the understanding of this state-of-the-art technology will help me to keep myself updated with the research trends in the industry.

Here I go… wish me luck!

Follow

Get every new post delivered to your Inbox.