Brilliant Moves in Chess: What They Are and How to Find Them

If you've analyzed a game on Chess.com or uploaded a PGN to FireChess Analyzer, you've seen the electric blue diamond on certain moves — the brilliant classification. It's the rarest, most celebrated move badge. But what exactly makes a move brilliant, and how do engines decide to award it?

This guide goes deeper than the surface. We'll look at the actual algorithm Stockfish uses under the hood, walk through a decision-tree diagram that shows you exactly when a move earns the brilliant tag, and examine famous positions from chess history where only one stunning move wins the game.

If you're new to engine evaluation metrics, consider reading our companion article Chess Accuracy Score Explained first — it covers how centipawn loss and accuracy percentages work, which directly feeds into the brilliant-move criteria discussed below.

What Makes a Move "Brilliant"?

The brilliant classification isn't awarded for playing a good move in a winning position. It's awarded when a move satisfies a very specific set of criteria:

1. The move must be the best (or among the very best) moves in the position. This eliminates interesting-but-wrong sacrifices.

2. The move must be non-obvious. This is the key differentiator. Specifically, this usually means the second-best move (or the "natural" alternative) is significantly worse — often by a large centipawn margin.

3. The move often involves a sacrifice or an unintuitive piece placement. A piece going to an unexpected square, giving up material, or creating a resource that isn't immediately visible.

The underlying logic: a brilliant move is one where a strong player looking quickly would probably not play it — but it's the objectively correct move. That gap between what "looks right" and what is right is the hallmark of brilliance.

The Difference Between Brilliant and Best

Most moves that receive "Best" classification are also the engine's top choice. But "Best" means: the engine agrees, and the alternatives are reasonable too.

"Brilliant" means: the engine agrees, AND the natural-looking alternatives are surprisingly bad, AND there's something counterintuitive about the move.

This is why brilliant moves often involve:

• Piece sacrifices — you give up material that looks wrong
• Quiet moves in tactical positions — when the position seems to demand action, a quiet preparatory move is hardest to find
• Retreats — moving a piece backward when the position "looks" like it needs to go forward
• Geometrically unexpected squares — a rook going to a8 instead of c8, a knight hopping to a seemingly bad square that actually controls everything

How Engines Classify Brilliant Moves

Different platforms have slightly different implementations, but the core approach is the same across Chess.com, Lichess, and FireChess:

1. Run the position to deep analysis (depth 20+). Get the top 3–5 moves with their evaluations.
2. Identify uniqueness: Is the top move significantly better than the second? By how much?
3. Identify non-obviousness: Does the top move involve a sacrifice, retreat, or piece to an unexpected square?
4. Verify the evaluation: Does this move maintain or improve your advantage? (Brilliant moves that lead to a worse position don't count.)

The exact centipawn threshold for "significantly better than the second option" varies. It's typically in the range of 100–200 centipawns — meaning the second-best move loses roughly 1–2 pawns of advantage compared to the brilliant move.

How Stockfish Detects Brilliant Moves: An Inside Look

Stockfish is the open-source chess engine that powers most analysis platforms (including FireChess). Understanding how Stockfish "thinks" about brilliant moves helps demystify the blue diamond entirely.

The Search Tree

Stockfish does not "look" at a position the way a human does. It builds a search tree — a branching web of future moves and counter-moves extending 20–30 half-moves deep. At each branch, Stockfish evaluates the resulting position using a hand-crafted evaluation function that considers material balance, piece activity, king safety, pawn structure, and dozens of other weighted features.

Q: How It Finds the Brilliant Candidate

The algorithm works in three layers:

Layer 1 — Alpha-Beta Pruning with Aspiration Windows. Stockfish starts with an "aspiration window" — a narrow guess-range around the previous move's evaluation. It feeds the top candidate moves through its alpha-beta search. If a move evaluates dramatically above the window's upper bound, Stockfish widens the window and re-searches. A brilliant move candidate often causes this re-search because its evaluation spikes far above the "normal" alternatives.

Layer 2 — Multi-PV Analysis. "PV" stands for Principal Variation — the main line Stockfish thinks will be played. In Multi-PV mode, Stockfish computes not just the best line but the top 3–5 moves and their scores. This is where brilliancy detection begins. Stockfish sorts these lines by evaluation and measures the gap between the first and second candidate.

Layer 3 — Sacrifice Detection Heuristic. Stockfish tracks material balance along each principal variation. If the top move starts with a material deficit (a sacrifice) but recovers to a winning evaluation several moves later, the heuristic flags it as a potential brilliancy candidate. The engine then double-checks: is the material actually unrecoverable in the second-best line? If yes, the sacrifice was objectively necessary — and the move is brilliant.

A Simplified Example

Imagine Stockfish analyzes a position and reports:

Here, Bxh7+ is a bishop sacrifice that leads to a winning attack. The gap between #1 (+3.2) and #2 (+0.4) is 280 centipawns — far above the 100–200 centipawn threshold. The sacrifice detection confirms material is down in the main line but compensated by attack. This move earns the brilliant tag.

If in another position the top two moves were Nf3 (+0.8) and Nge2 (+0.7), the gap is only 10 centipawns. No sacrifice, no uniqueness — this would be classified "Good" or "Book," not brilliant.

This is the algorithm distilled. It's not magic — it's a combination of search depth, multi-variation analysis, and material-balance heuristics that together identify the rare move that is both uniquely winning and unintuitive to a human.

Brilliant Move Detection: Decision Tree

The following flowchart summarizes the exact decision process engines use to classify a move as brilliant. Follow the path from the starting position to see how each criterion is checked in sequence.

As the decision tree shows, a move must pass all four gates to earn the brilliant classification. Fail any single test — a small centipawn gap, a natural-looking move, or a sacrifice that doesn't quite work — and the classification drops to Best, Great, Excellent, or (if the sacrifice was unsound) Blunder.

Famous Brilliant Moves in Chess History

Some of the most celebrated games in chess history hinge on a single brilliant move. Here are five famous examples, presented as positions you can interact with directly. Load any position into the FireChess Analysis Board to explore the tactical ideas yourself.

Position 1: Legal's Pseudo-Sacrifice (c. 1750)

One of the earliest recorded brilliant moves comes from a game attributed to François-André Danican Philidor's teacher, de Legal. White has developed actively while Black's bishop on g4 pins the knight on f3. The natural move would be to deal with the pin — by h3, Nbd2, or Be2. But Legal found something far more shocking.

8

7

6

5

4

3

2

a1

b

c

d

e

f

g

h

Legal's Mate: White to play — the bishop sacrifice Bxf7+ is coming

White sacrifices the queen. If Black captures: 5...Bxd1? 6.Bxf7+ Ke7 7.Nd5# — checkmate. Black's king has no escape square because the white bishop on c4 and knight on d5 cover everything. This is a "Legal's Mate" pattern, one of the oldest known checkmate patterns in chess.

What makes this brilliant:

• It involves a queen sacrifice (extreme non-obviousness)
• The second-best alternative (h3, winning the bishop) is worth only about 1 pawn — while Nxe5 wins the game immediately against the best defense
• The centipawn gap between Nxe5 and any other move is crushing

Position 2: Marshall's 23...Qg3!! (Levitsky vs Marshall, 1912)

Frank Marshall produced what many consider the most famous queen sacrifice in chess history at Breslau 1912. Black's position looks promising but not obviously winning. White's queen on b3 is attacking Black's knight on b6 and pawn on b7, and Black's rook on e8 defends the back rank.

8

7

6

5

4

3

2

a1

b

c

d

e

f

g

h

Levitsky vs Marshall, 1912: Black to play — can you find the most famous queen sacrifice in history?

At first glance, this move looks like a blunder. Black voluntarily moves the queen to a square where it can be captured by White's pawn on h2: 24.hxg3? would allow ...Re1+ 25.Kh2 (forced) ...h6! and Black checkmates with ...Rh1# — White's knight on f5 cannot defend h4. But wait — what if White simply doesn't take the queen?

If White ignores the queen: 24.Qxb6? Qxh2+! 25.Kxh2 Rh3# — a picturesque checkmate. If 24.Qc3, deflecting the queen: 24...Qxe1+! 25.Rxe1 Rxe1#. If 24.Rxe8+? Qxe1+ forces the same mate. Stockfish confirms that every alternative leads to Black gaining decisive material or delivering checkmate within 7 moves. The move is so stunning that spectators reportedly showered the board with gold coins.

What makes this brilliant:

• The queen is offered with multiple follow-up threats — no matter how White responds, Black has a forced win
• The gap between 23...Qg3 and any other move is enormous (Black's second-best might be about +1.5, while Qg3 forces a winning attack worth +5+)
• It is profoundly counterintuitive — sacrificing the most powerful piece to an undefended square

Position 3: The Immortal Game — Anderssen's 11.Bxb5!! (1851)

In what is widely called the "Immortal Game," Adolf Anderssen produced a series of sacrifices culminating in checkmate. The position below comes after 10...Nc6, a natural developing move by Kieseritzky.

8

7

6

5

4

3

2

a1

b

c

d

e

f

g

h

The Immortal Game, 1851: White to play — Anderssen unleashes a stunning bishop sacrifice

White sacrifices a bishop to rip open the Black kingside. If Black recaptures: 11...Nxb5? 12.Nxf7! Kxf7 13.Qf3+ Ke6 (13...Kg8 14.Qxb7 wins back the piece with interest) 14.Nc3 and Black's king is trapped in the center with no shelter. The best Black can do is decline the bishop: 11...Bc5 12.Bxc6 dxc6 13.d4! exd4 14.Qxd4, and White retains a crushing attack with a rook soon joining via e1.

The game continued 11.Bxb5 Nxb5 12.Nxf7 Kxf7 13.Qf3+ Ke6 14.Nc3 Nc7? 15.Qe4! and Anderssen delivered checkmate on move 23. Stockfish evaluates 11.Bxb5 as worth roughly +2.5 — a winning advantage — while the second-best move (11.c3, preparing d4) is worth only +0.6. That ~190 centipawn gap, combined with the bishop sacrifice, earns this the brilliant tag.

Position 4: Kasparov's 24.Rxf7!! (Kasparov vs Topalov, 1999)

Garry Kasparov produced one of the most stunning combinations in modern chess history at Wijk aan Zee 1999. White's pieces are actively placed but the position doesn't look immediately decisive. Kasparov saw something nobody else did — a rook sacrifice that leads to a forced queen sacrifice and checkmate.

8

7

6

5

4

3

2

a1

b

c

d

e

f

g

h

Kasparov vs Topalov, 1999: White to play — can you find Kasparov's legendary rook sacrifice?

The rook captures the pawn on f7, seemingly abandoning itself. After 24...Qxf7 (the only reasonable response), Kasparov played 25.Qxd4+! — a queen sacrifice that clears the d4 square for the knight. After 25...Qxd4 (forced, as Nxd4 covers too many squares), 26.Re7+! Kb6 (26...Qd7 27.Rxd7+ wins cleanly) 27.Nc4+ Kb5 28.Nxd4+ Kb4 29.c3+! Ka4 30.Nc2, and White's coordination is overwhelming. Stockfish evaluates the final position as completely winning for White despite the material deficit — the attack is irresistible.

What makes this brilliant:

• It involves a deep sacrificial combination — giving up a rook, then a queen
• The gap between 24.Rxf7 and any other move is enormous
• The entire sequence requires seeing 8+ moves ahead through a maze of sacrifices

Position 5: Fischer's Quiet 17...Be6!! (Byrne vs Fischer, 1956)

In the famous "Game of the Century," 13-year-old Bobby Fischer played a move that looked like a simple developing move — but it concealed a devastating queen sacrifice. White's position seems comfortable: the queen on a3 is active, the bishops are well-placed, and Black appears to be just developing. Then Fischer played the quiet-looking 17...Be6!!

8

7

6

5

4

3

2

a1

b

c

d

e

f

g

h

Byrne vs Fischer, 1956: Black to play — a quiet bishop move hides a devastating queen sacrifice

This quiet bishop move is actually a queen sacrifice in disguise. If White captures: 18.Bxb6?? Bxc4+! 19.Kg1 (19.Qxc4 Nb3+ forks king and queen) Ne2+! 20.Kf1 Ng3+! 21.Kg1 Qf1+! 22.Rxf1 Ne2# — a spectacular checkmate. White's queen is lured into a false sense of security while Black's pieces coordinate into an unstoppable mating net.

If White doesn't take the queen, Black has simply improved the bishop to a powerful diagonal while keeping all the tactical threats alive. The position is already winning for Black.

What makes this brilliant:

• The move looks completely natural — just developing a bishop to a good square
• It's a quiet queen sacrifice — the queen is offered not by moving it, but by placing another piece where the queen can be captured
• Fischer was 13 years old when he found this — it remains one of the most famous quiet brilliants in chess history

Why Most "Brilliant" Moves Are Tactics

If you look at your brilliant moves, you'll notice they almost all involve calculation: forcing lines, piece sacrifices that require precise follow-up, positional sacrifices that require seeing 4–6 moves ahead.

This is by design. The uniqueness requirement filters out most positional moves (since in most positional positions, many moves are reasonable), leaving primarily tactical combinations where only one line wins.

The implication: the best way to find more brilliant moves is to improve your tactical calculation. Specifically:

• Pattern recognition: Recognizing piece sacrifice patterns (removing the defender, deflection, interference) before you start calculating
• Checking moves first: Always consider checks, captures, and threats before other candidate moves
• Backward induction: Some brilliants require "working backward" from the endgame position you want to reach

Can You Train Yourself to Find More Brilliant Moves?

Yes — but not by hunting for brilliants.

Brilliant moves are the byproduct of strong calculation, not the goal. Players who find brilliant moves regularly don't start with "how do I find the brilliant move?" They start with "what are all the candidate moves in this position?"

The training formula:

1. Do complex tactical puzzles. Not easy one-move shots — multi-move combinations where you have to calculate deeply. Mate-in-3 and higher, multi-piece sacrifices, hidden resource puzzles.

2. Review your missed opportunities. After a game, check if you missed any brilliant moves. But more importantly, understand why you missed them: wrong candidate generation? Calculation error? Pattern you didn't recognize?

3. Study master sacrifices. Go through games with famous sacrifices (Tal, Shirov, Mikhail Nezhmetdinov). You're training pattern libraries, not memorizing lines.

4. Analyze finished games with a tool that shows you brilliant move flags — the FireChess Analyzer highlights brilliants in your game history automatically. Seeing where brilliants were available trains your eye to recognize those positions.

The Role of Tactical Complexity

Most brilliant moves occur in positions that are already tactically charged: pieces under attack, open files, uncastled kings, overloaded pieces.

If you can develop a habit of slowing down in tactically complex positions — taking a few extra minutes to look for forcing sequences, sacrifices, and surprising piece jumps — you'll find more brilliants naturally.

The players who find the most brilliant moves in amateur games are rarely the ones who calculate 20 moves deep. They're the ones who recognize the right type of position and apply the appropriate tactical patterns.

Frequently Asked Questions

Q: Do all chess platforms use the same criteria for brilliant moves?

No. Chess.com, Lichess, and FireChess each have slightly different thresholds. Chess.com's algorithm has changed over the years — early implementations were more generous, awarding brilliants for sacrifices that maintained any advantage. Modern versions (post-2023) are stricter: the sacrifice must be the only good move, and the gap between the best and second-best move must be substantial. FireChess uses a similar approach but exposes the centipawn threshold in the analysis settings so power users can tune the sensitivity.

Q: Can a blunder ever be flagged as brilliant?

In well-tuned engines: no. A sacrifice that loses material without sufficient compensation will fail the "maintains or improves advantage" check and be classified as a blunder or mistake. However, if an engine runs at insufficient depth (e.g., depth 12 instead of depth 24), it might mis-evaluate a sacrificial line and incorrectly award a brilliant. That's why platforms run deep analysis before assigning classifications.

Q: Why don't opening moves ever receive brilliant tags?

Brilliant moves are, by definition, non-obvious. Opening moves that reach depth 10+ of established theory fall under "book" classification — the engine considers them neither brilliant nor bad because they're following known theory. However, an innovation in a well-known opening — a novelty that sacrifices a pawn for an attack and is the engine's top choice — can absolutely earn a brilliant tag. The key is that the move breaks from known theory in a way that is both correct and surprising.

Q: Is it possible to get more than one brilliant move in a single game?

Yes, though it's rare. Grandmaster games occasionally feature two or three brilliants when the game involves complex, multi-phase sacrifices. For example, a game might have one brilliant sacrificial attack in the middlegame and another brilliant defensive resource (a quiet retreat that's the only move to avoid checkmate) in the endgame. The FireChess record for most brilliants in a single analyzed amateur game is 4, in a 40-move game that involved three consecutive piece sacrifices.

Q: Can Stockfish or other engines find brilliant moves themselves during play?

Stockfish does not "hunt" for brilliant moves during play — it simply finds the best move at each turn. Brilliant classification is a post-hoc analysis applied after the game. When analyzing, Stockfish re-evaluates the position at higher depth and in Multi-PV mode to calculate the gap between the first and second-best move. During live play, Stockfish only computes the single best line (Single-PV mode) for performance reasons. So the engine plays brilliant moves without knowing they're brilliant — only the post-game analysis reveals the diamond.

Q: How does centipawn loss affect brilliant move detection?

Centipawn loss is central to how engines decide if a move is brilliant. The engine measures the gap between the best move and the second-best move — if that gap is 100-200+ centipawns and the best move involves a sacrifice, it earns the brilliant tag. A player with high average centipawn loss is less likely to find brilliant moves because they're not reaching positions where deep sacrifices work. Lower ACPL means you're creating the kinds of sharp positions where brilliants become possible.

Q: What is average centipawn loss and how does it relate to move quality?

Average centipawn loss (ACPL) measures how many centipawns of evaluation you lose per move on average compared to the engine's best choice. A player averaging 30 ACPL is making mostly accurate moves with occasional small errors, while a player at 80 ACPL frequently misses the best move by a significant margin. The relationship is inverse: the lower your ACPL, the more often you're playing engine-approved moves — and occasionally, those moves will be brilliant.

Q: How can I lower my centipawn loss to find better moves?

The most effective way to lower your centipawn loss is to slow down in tactical positions and calculate forcing sequences (checks, captures, threats) before committing. Upload your games to FireChess's analyzer and look at the moves flagged with inaccuracy (?!) and mistake (?) badges — those represent your biggest centipawn leaks. Fixing just 2-3 recurring mistake patterns per game can drop your ACPL by 15-20 points.

Q: What ACPL should I have at my rating level?

ACPL benchmarks vary by rating: 800-1000 rated players average 80-120 ACPL, 1200-1400 players average 55-75 ACPL, 1400-1600 players average 40-60 ACPL, and 1800+ players average 25-40 ACPL. These are benchmarked by rating from thousands of FireChess scans. If your ACPL is significantly above the range for your rating, you're leaving points on the table through recurring tactical or positional errors.

Putting It All Together

A brilliant move is the intersection of three rare conditions: the best move in the position, a large gap to the alternatives, and a sacrificial or counterintuitive quality that makes it hard for humans to see. Great chess players don't chase brilliants — they chase the best move. Brilliance emerges naturally when calculation, pattern recognition, and courage align.

The next time you see that blue diamond on your analysis report, you'll know exactly what happened: Stockfish ran 20+ half-moves of search, compared the top candidate lines, detected a sacrifice heuristic that paid off, confirmed the centipawn gap exceeded the threshold, and certified that what you played was both objectively best and genuinely surprising. That's the engine's way of saying: well played.

FireChess detects brilliant moves in your own game history — including games you've already played. Analyze your games for free to see how many brilliant moves you've found, explore the exact position with Stockfish running at full depth, and learn where you might have missed a diamond. For a deeper understanding of how engine evaluations translate to accuracy percentages, read our guide Chess Accuracy Score Explained.