The N queens problem is the problem of placing N queens on an N×N chessboard such that none of them attack one another (no two are in the same row, column, or diagonal). More generally, the n queens problem places n queens on an n×n chessboard.
9Apps 4.9
