The eight queens puzzle is the problem of placing eight chess queens on an 8×8 chessboard such that none of them are able to capture any other using the standard chess queen’s moves. This puzzle can be generalized to the problem of placing n queens on a nxn chessboard. This c++ program finds solutions to this problem using a recursive backtracking algorithm.

Aswin van Woudenberg

I'm a software engineer based in the Netherlands. Besides software, I am also interested in areas ranging from music and art to mathematics and literature.

Leave a Reply

Your email address will not be published. Required fields are marked *