How can N queens be placed on an NxN chessboard so that no two of them attack each other?
How can N queens be placed on an NxN chessboard so that no two of them attack each other?
How can N queens be placed on an NxN chessboard so that no two of them attack each other?
How can N queens be placed on an NxN chessboard so that no two of them attack each other?
https://developers.google.com/optimization/puzzles/queens