All 92 Solutions to the Eight Queens Puzzle

Every valid arrangement of eight non-attacking queens on an 8x8 chessboard — with the 12 fundamental solutions, symmetry analysis, and pattern exploration.

Overview: 92 Unique, 12 Fundamental

The Eight Queens Puzzle — placing 8 queens on an 8x8 chessboard so that no two queens attack each other — has exactly 92 valid solutions. This number was first determined by Franz Nauck in 1850, and has since been verified many times over by mathematicians and computer scientists.

To understand these 92 solutions, it helps to know that they are not all truly distinct in a deep mathematical sense. Many are simply rotations or mirror images of each other. When we consider solutions that cannot be transformed into one another through board symmetry as truly different, only 12 fundamental solutions remain.

The relationship 12 → 92 is one of the most elegant aspects of this puzzle. It connects the Eight Queens Problem to group theory, symmetry, and combinatorics — areas of mathematics with deep implications far beyond this puzzle. For the complete mathematical background, see Queens Puzzle Mathematics.

If you want to find these solutions yourself before reading further, the interactive puzzle is a great starting point. The solving guide explains the systematic methods.

Understanding Fundamental vs Total Solutions

This distinction is central to understanding why there are exactly 92 solutions and not some other number.

What is a Fundamental Solution?

A fundamental solution (also called a distinct solution or essentially different solution) is a solution that cannot be obtained from another solution by rotating or reflecting the board. Two solutions are in the same equivalence class if one can be transformed into the other using these symmetry operations.

The 8 Symmetry Operations of a Square

A square (and therefore an 8x8 chessboard) has exactly 8 symmetry operations, forming what mathematicians call the dihedral group D4:

  1. Identity: No transformation (leave as is)
  2. Rotation 90 degrees: Rotate the board 90 degrees clockwise
  3. Rotation 180 degrees: Rotate the board 180 degrees
  4. Rotation 270 degrees: Rotate the board 270 degrees clockwise
  5. Reflection horizontal: Flip the board left-to-right
  6. Reflection vertical: Flip the board top-to-bottom
  7. Reflection diagonal (main): Flip along the top-left to bottom-right diagonal
  8. Reflection diagonal (anti): Flip along the top-right to bottom-left diagonal

From 12 to 92: The Arithmetic

If every fundamental solution generated 8 distinct variants, we would expect 12 x 8 = 96 solutions. But we get only 92 — a shortfall of 4. This is because one fundamental solution is self-symmetric: it looks the same after a 180 degree rotation. That self-symmetric solution generates only 4 distinct variants (not 8), accounting for the difference: 11 x 8 + 1 x 4 = 88 + 4 = 92.

The self-symmetric fundamental solution is: [5, 3, 8, 4, 7, 1, 6, 2]. Rotating the board 180 degrees transforms this into itself.

The 12 Fundamental Solutions

Each solution below is written as a sequence of 8 numbers. The number in position i tells you which column the queen in row i is placed in (columns numbered 1–8 left to right, rows numbered 1–8 top to bottom).

For example, [1, 5, 8, 6, 3, 7, 2, 4] means: Row 1 → Column 1, Row 2 → Column 5, Row 3 → Column 8, Row 4 → Column 6, Row 5 → Column 3, Row 6 → Column 7, Row 7 → Column 2, Row 8 → Column 4.

# Column Positions (Rows 1–8) Notes
F1[1, 5, 8, 6, 3, 7, 2, 4]Classic solution
F2[1, 6, 8, 3, 7, 4, 2, 5]
F3[1, 7, 4, 6, 8, 2, 5, 3]
F4[2, 4, 6, 8, 3, 1, 7, 5]
F5[2, 5, 7, 1, 3, 8, 6, 4]
F6[2, 5, 7, 4, 1, 8, 6, 3]
F7[3, 6, 2, 7, 1, 4, 8, 5]
F8[3, 6, 4, 1, 8, 5, 7, 2]
F9[4, 2, 7, 3, 6, 8, 5, 1]
F10[4, 6, 8, 2, 7, 1, 3, 5]
F11[5, 2, 4, 7, 3, 8, 6, 1]
F12[5, 3, 8, 4, 7, 1, 6, 2]Self-symmetric (180 degree rotation)

These 12 solutions serve as the "parents" for all 92 solutions. By applying the 8 symmetry operations to each, you can generate the complete set.

How Symmetry Generates All 92

Understanding how symmetry transforms solutions is key to seeing the underlying structure of all 92 solutions. Let us walk through how the first fundamental solution generates its family.

Applying Transformations to F1: [1, 5, 8, 6, 3, 7, 2, 4]

Horizontal reflection (mirror left-to-right): Replace each column c with 9−c.
[1,5,8,6,3,7,2,4] → [8,4,1,3,6,2,7,5]

Vertical reflection (mirror top-to-bottom): Reverse the row order.
[1,5,8,6,3,7,2,4] → [4,2,7,3,6,8,5,1] (this is actually F9!)

180 degree rotation: Apply both horizontal and vertical reflections simultaneously.
[1,5,8,6,3,7,2,4] → [5,7,2,6,1,3,8,4]

90 degree clockwise rotation: The transformation is more complex — it requires converting the permutation to a new coordinate system. The queen at row r, column c moves to position (row = c, column = 9−r) in the new orientation.

Each of these 8 transformations produces a (potentially) different valid solution. For F1, all 8 are distinct, giving 8 solutions in the F1 family. For F12 ([5,3,8,4,7,1,6,2]), the 180 degree rotation produces the same arrangement, so only 4 distinct solutions emerge from its 8 transformations.

Solution Family Sizes

Fundamental Family Size Reason
F1–F118 eachNo self-symmetry
F124Self-symmetric under 180 degree rotation
Total11x8 + 1x4 = 92

This mathematical elegance is why the Eight Queens Puzzle has fascinated mathematicians since its invention. For more on the mathematical connections, visit Queens Puzzle Mathematics.

Complete List of All 92 Solutions

Below is the complete list of all 92 solutions. Each solution is written as column positions for rows 1–8.

# Solution (cols for rows 1–8) # Solution (cols for rows 1–8)
1 [1, 5, 8, 6, 3, 7, 2, 4] 47 [5, 3, 1, 7, 2, 8, 6, 4]
2 [1, 6, 8, 3, 7, 4, 2, 5] 48 [5, 3, 8, 4, 7, 1, 6, 2]
3 [1, 7, 4, 6, 8, 2, 5, 3] 49 [5, 7, 1, 3, 8, 6, 4, 2]
4 [2, 4, 6, 8, 3, 1, 7, 5] 50 [5, 7, 1, 4, 2, 8, 6, 3]
5 [2, 5, 7, 1, 3, 8, 6, 4] 51 [5, 7, 2, 4, 8, 1, 3, 6]
6 [2, 5, 7, 4, 1, 8, 6, 3] 52 [5, 7, 2, 6, 3, 1, 4, 8]
7 [2, 6, 1, 7, 4, 8, 3, 5] 53 [5, 7, 4, 1, 3, 8, 6, 2]
8 [2, 6, 8, 3, 1, 4, 7, 5] 54 [5, 8, 4, 1, 3, 6, 2, 7]
9 [2, 7, 3, 6, 8, 5, 1, 4] 55 [5, 8, 4, 1, 7, 2, 6, 3]
10 [2, 8, 6, 1, 3, 5, 7, 4] 56 [6, 1, 5, 2, 8, 3, 7, 4]
11 [3, 1, 7, 5, 8, 2, 4, 6] 57 [6, 2, 7, 1, 3, 5, 8, 4]
12 [3, 5, 2, 8, 1, 7, 4, 6] 58 [6, 2, 7, 1, 4, 8, 5, 3]
13 [3, 5, 2, 8, 6, 4, 7, 1] 59 [6, 3, 1, 7, 5, 8, 2, 4]
14 [3, 5, 7, 1, 4, 2, 8, 6] 60 [6, 3, 1, 8, 4, 2, 7, 5]
15 [3, 5, 8, 4, 1, 7, 2, 6] 61 [6, 3, 1, 8, 5, 2, 4, 7]
16 [3, 6, 2, 7, 1, 4, 8, 5] 62 [6, 3, 5, 7, 1, 4, 2, 8]
17 [3, 6, 2, 7, 5, 1, 8, 4] 63 [6, 3, 5, 8, 1, 4, 2, 7]
18 [3, 6, 4, 1, 8, 5, 7, 2] 64 [6, 3, 7, 2, 4, 8, 1, 5]
19 [3, 6, 8, 1, 4, 7, 5, 2] 65 [6, 3, 7, 2, 8, 5, 1, 4]
20 [3, 7, 2, 8, 5, 1, 4, 6] 66 [6, 3, 7, 4, 1, 8, 2, 5]
21 [3, 7, 2, 8, 6, 4, 1, 5] 67 [6, 4, 1, 5, 8, 2, 7, 3]
22 [3, 8, 4, 7, 1, 6, 2, 5] 68 [6, 4, 2, 8, 5, 7, 1, 3]
23 [4, 1, 5, 8, 2, 7, 3, 6] 69 [6, 4, 7, 1, 3, 5, 2, 8]
24 [4, 1, 5, 8, 6, 3, 7, 2] 70 [6, 4, 7, 1, 8, 2, 5, 3]
25 [4, 2, 5, 8, 6, 1, 3, 7] 71 [6, 8, 2, 4, 1, 7, 5, 3]
26 [4, 2, 7, 3, 6, 8, 5, 1] 72 [7, 1, 3, 8, 6, 4, 2, 5]
27 [4, 2, 8, 5, 7, 1, 3, 6] 73 [7, 2, 4, 1, 8, 5, 3, 6]
28 [4, 2, 8, 6, 1, 3, 5, 7] 74 [7, 2, 6, 3, 1, 4, 8, 5]
29 [4, 6, 1, 5, 2, 8, 3, 7] 75 [7, 3, 1, 6, 8, 5, 2, 4]
30 [4, 6, 8, 2, 7, 1, 3, 5] 76 [7, 3, 8, 2, 5, 1, 6, 4]
31 [4, 6, 8, 3, 1, 7, 5, 2] 77 [7, 4, 2, 5, 8, 1, 3, 6]
32 [4, 7, 1, 8, 5, 2, 6, 3] 78 [7, 4, 2, 8, 6, 1, 3, 5]
33 [4, 7, 3, 8, 2, 5, 1, 6] 79 [7, 5, 3, 1, 6, 8, 2, 4]
34 [4, 7, 5, 2, 6, 1, 3, 8] 80 [7, 5, 3, 8, 1, 6, 4, 2]
35 [4, 7, 5, 3, 1, 6, 8, 2] 81 [8, 2, 4, 1, 7, 5, 3, 6]
36 [4, 8, 1, 3, 6, 2, 7, 5] 82 [8, 2, 5, 3, 1, 7, 4, 6]
37 [4, 8, 1, 5, 7, 2, 6, 3] 83 [8, 3, 1, 6, 2, 5, 7, 4]
38 [4, 8, 5, 3, 1, 7, 2, 6] 84 [8, 4, 1, 3, 6, 2, 7, 5]
39 [5, 1, 4, 6, 8, 2, 7, 3] 85 [8, 4, 1, 5, 7, 2, 6, 3]
40 [5, 1, 8, 4, 2, 7, 3, 6] 86 [8, 4, 1, 7, 5, 2, 6, 3]
41 [5, 1, 8, 6, 3, 7, 2, 4] 87 [8, 2, 4, 1, 3, 5, 7, 6]
42 [5, 2, 4, 6, 8, 3, 1, 7] 88 [8, 3, 1, 7, 5, 2, 6, 4]
43 [5, 2, 4, 7, 3, 8, 6, 1]
44 [5, 2, 6, 1, 7, 4, 8, 3]
45 [5, 2, 8, 1, 4, 7, 3, 6]
46 [5, 3, 1, 6, 8, 2, 4, 7]

Each number (1–8) represents the column where the queen is placed in that row.

Patterns Across Solutions

Examining all 92 solutions reveals fascinating structural patterns. These patterns are not merely curiosities — they reflect deep mathematical properties of the puzzle.

Column Frequency in Row 1

How often does the first row queen appear in each column across all 92 solutions?

Column 1 2 3 4 5 6 7 8
Count 11 12 12 12 11 10 12 12

The distribution is nearly uniform — each column hosts approximately 11–12 first-row queens across all 92 solutions. This reflects the symmetry of the problem: by the board symmetry argument, columns 1 and 8 are equivalent (as are 2 and 7, etc.), so their frequencies should be equal.

Center Columns Are Used More

Across all 92 solutions, columns 4 and 5 appear slightly more frequently in total queen placements compared to columns 1 and 8. This makes intuitive sense: a queen in the center column covers the most diagonal territory, making it harder to place surrounding queens — but when it works, it often leads to balanced configurations.

No Solution Has Adjacent Queens

In every one of the 92 solutions, no two queens occupy squares that are horizontally or vertically adjacent. This is guaranteed by the non-attacking constraint (same row/column rule), but diagonally adjacent queens are also impossible because that would mean the row and column difference are both 1, putting them on the same diagonal.

The Queen Coverage Pattern

In a valid solution, the 8 queens collectively attack (or occupy) a large portion of the board, but some squares are always left unattacked. These "free squares" vary by solution but average around 12–15 per solution.

For more mathematical analysis, see Queens Puzzle Mathematics. To explore solutions interactively, visit the solutions browser.

Interactive Exploration

Reading about solutions is one thing — seeing them play out on a real board is another. The best way to deeply understand why these 92 arrangements work is to explore them interactively.

Our solutions browser lets you cycle through all 92 solutions and see each one visually on an 8x8 board. You can observe which squares are attacked, how queens are distributed, and how symmetry-related solutions compare.

To practice finding solutions yourself using the strategies discussed in this article, visit the interactive puzzle. The puzzle gives you immediate feedback when queens conflict, making it an excellent learning tool.

If you want to understand the deeper mathematics behind these 92 solutions — including connection to combinatorics, group theory, and the N-Queens generalization — see Queens Puzzle Mathematics.

Solutions Browser

Explore all 92 solutions visually on an interactive board.

Play the Puzzle

Try to find solutions yourself with instant conflict feedback.

Puzzle Math

Understand the mathematics behind why 92 solutions exist.

Frequently Asked Questions

How many solutions does the Eight Queens Puzzle have?

The Eight Queens Puzzle has exactly 92 unique solutions. This was first determined by Franz Nauck in 1850 and has since been verified computationally. All 92 solutions are listed on this page.

What are the 12 fundamental solutions to the Eight Queens Puzzle?

The 12 fundamental solutions are those that cannot be derived from each other by rotating or reflecting the board. They are the unique "parent" solutions from which all 92 solutions can be generated. The 12 fundamental solutions are listed in the table above, labeled F1 through F12.

Are all 92 solutions to the Eight Queens Puzzle truly unique?

Yes, all 92 solutions are distinct arrangements of queens on the board — no two solutions have queens in exactly the same positions. However, 80 of the 92 solutions come in groups of 8 that are rotations/reflections of each other (the other 4 come from the one self-symmetric fundamental solution). So while all 92 are geometrically distinct, mathematically only 12 are truly independent.

Who found all 92 solutions to the Eight Queens Puzzle?

Franz Nauck found all 92 solutions in 1850, two years after Max Bezzel first posed the puzzle in 1848. Nauck also generalized the problem to the N-Queens Puzzle. Carl Friedrich Gauss also studied the problem around the same time but only found 72 solutions initially. See the complete history of the puzzle.