The classic problem of N queens, originally published by Max Bezzel in 1848, is defined like this: Place N queens in a NxN chessboard so that no queen threatens any other. As you already may know, a queen threatens another chess piece if they share the same row, column or diagonal. This website simulates a slight alteration of the N queens problem, where in a NxN chessboard we need to place M queens ( M <= N) so that no queen threatens another and additionally, all chessboard tiles are threatened by at least one queen.

Pick a chessboard size N and an amount of queens M so that M<=N, select the speed you want the problem to run and hit on **"Simulation"** button.

- 4x4
- 5x5
- 6x6
- 7x7
- 8x8

- 3
- 4
- 5
- 6
- 7
- 8

- {{solution}}