The NQueens Problem

NQueens problem requires you to place N Queens on an NxN chess board without any of them threatening each other.
You can read more at Google Developers and Wikipedia.

for N = 8

For 8-Queens problem, you need to do the same with 8 Queens and an 8x8 chess board. There are 4,426,165,368 (64C8) ways to place all the queens on the board, with 92 of them being the correct solutions.

Q
Q
Q
Q
Q
Q
Q
Q

This web app provides helpers to solve the problem. Whenever a Queen is put on the board, it threatens some squares, since it can move in any possible direction (vertically, horizontally, diagonally) at any length. All the light and dark threatened squares are showed with white and black colors respectively. Any non-threatened square retains the initial colors. Solve by putting all Queens on board without them threatening each other.