I’m working on a project in C where I need to find all the solutions to the n-queens problem. It is a really interesting and challenging problem, which basically consists of trying to find all the possible placements in a nxn chessboard of an exact n number of queens, without threatening in between each other. It is known that there is an exact 234.907.967.154.122.528 number of solutions for n=27, the largest number discovered yet.