Did you find a solution? There are 92 solutions to the 8 x 8 queen puzzle problem. Many of these are reflections and rotations of some of the others, and if we de-duplicate against this, purists state that there are only 12 distinct solutions (92 does not divide equally by 12 because many of the reflections and rotations of a pure solutions are not unique).
Algorithm to solve eight/8 queen puzzle problem
There are many possible algorithms that can be used to find solutions to the eight queen’s problem, and a smaller subset of algorithms that can be used to enumerate all possible solutions.
The first possible mechanism is pure brute force; blindly trying the eight queens in every possible location. This is a really dumb idea, but would calculate all possible solutions (We’d have to examine 64!/56! = 178,462,987,637,760 possible placements, ouch!)
A more efficient algorithm (which can be implemented recursively or not) is to start in the first column in the top left, then it then places a queen in the second column and moves it until it finds a place where it cannot be hit by the queen in the first column.
If you’re only interested in one solution there are plenty of interesting iterative algorithms to select from. Many are not particularly efficient, but they are fun to code and experiment with. However you can try your luck to find the solution here with 8 queen puzzle simulator