The Queens Game is a classic logic puzzle derived from chess. The goal is deceptively simple: place a set of queens on a grid so that no two queens can attack each other. In chess, a queen can move any number of squares horizontally, vertically, or diagonally, which means each queen "controls" an entire row, column, and two diagonals simultaneously. Your challenge is to find a placement where every queen is safe from every other.
The most famous version is the 8 Queens Puzzle, played on a standard 8×8 chessboard with 8 queens. Mathematicians have studied this problem since the 1840s when chess composer Max Bezzel first posed it. The 8×8 board has exactly 92 distinct solutions, and only 12 of those are "fundamental" (the rest are reflections and rotations).
In 2024 and 2025, a colored-region variant called LinkedIn Queens went viral across social media and professional networks. In that version, the board is divided into colored regions, and each region must contain exactly one queen. This added constraint dramatically reduces the solution space and makes the puzzle approachable for newcomers while still rewarding careful logical deduction. Our site lets you play both the classic N-Queens version and think through the same kind of spatial reasoning that made the LinkedIn Queens game so popular.
Whether you call it the queens game, the queens puzzle, or the N-queens problem, the core cognitive challenge is the same: systematic elimination, constraint propagation, and pattern recognition. It is one of the most studied constraint-satisfaction problems in computer science, appearing in every introductory algorithms textbook as the canonical example of backtracking search.