How to Think in Chess: The Candidate Moves Method Explained

The candidate moves method helps chess players think clearly by narrowing down options before calculating. Instead of analysing every legal move, you first select a few strong candidate moves based on position, then calculate only those. This approach reduces blunders, saves time, and improves decision-making—especially for beginner and intermediate players.

Introduction

One of the biggest frustrations in chess is knowing what to think about during a game.

Many players:

• Calculate too much and still miss the best move

• Play quickly and overlook simple threats

• Freeze when faced with too many choices

The issue is rarely intelligence or talent. It is thinking structure.

Strong players do not calculate everything. They filter first.
This is where the candidate moves method becomes one of the most powerful thinking tools in chess.

What are candidate moves?

Candidate moves are a small selection of moves that deserve serious calculation.

Instead of asking:

“What is the best move?”

You ask:

“Which 2–4 moves are worth considering?”

Only those moves get calculated.

This approach was popularised by classical grandmasters and remains essential even in the engine era.

Why calculating everything does not work

At any given moment, a chess position may offer:

• 30–40 legal moves

• multiple tactical ideas

• hidden threats

Trying to calculate all of them leads to:

• time trouble

• shallow calculation

• mental fatigue

• random decisions

The candidate moves method fixes this by reducing complexity first.

Step 1: Evaluate the position before calculating

Before looking for moves, briefly assess the position.

Ask:

• Who is better, and why?

• Is the position tactical or strategic?

• Are there immediate threats?

This step takes only a few seconds but determines the right thinking approach.

Step 2: Identify forcing moves first

Forcing moves must always be checked.

These include:

• Checks

• Captures

• Threats (especially against the king)

If a forcing move exists, it often becomes a candidate automatically.

Step 3: Add positional candidate moves

If no forcing move dominates, look for improving moves:

• Activating a piece

• Improving king safety

• Controlling key squares

• Preparing a pawn break

At this stage, limit yourself to 2–4 moves maximum.

More than that defeats the purpose.

Step 4: Eliminate weak candidates quickly

You do not need deep calculation to discard bad moves.

Reject moves that:

• Hang material

• Ignore opponent threats

• Create unnecessary weaknesses

• Violate basic principles

This pruning step is crucial and saves enormous time.

Step 5: Calculate only the remaining moves

Now calculate carefully:

• Check opponent replies

• Look for tactics

• Compare resulting positions

Because you are calculating fewer lines, your calculation becomes deeper and more accurate.

Example: candidate moves in a typical middlegame

Imagine a quiet middlegame with no immediate tactics.

A beginner might:

• Move a random piece

• Push a pawn without reason

• Miss a strategic idea

Using candidate moves, you might select:

1. Improve rook to an open file

2. Centralise a knight

3. Prevent opponent’s pawn break

From there, calculation becomes manageable.

Common mistakes when using candidate moves

Candidate moves vs intuition

Candidate moves work with intuition, not against it.

• Intuition suggests ideas

• Candidate moves structure them

• Calculation confirms them

This is how strong players combine speed and accuracy.

How engines changed—but did not replace—this method

Engines calculate everything. Humans cannot.

Even top players still:

• Use candidate moves

• Filter options

• Calculate selectively

Engines assist training, but human thinking still needs structure.

When the method is most useful

The candidate moves method shines in:

• Long games

• Time pressure

• Quiet positions

• Tournament play

Ironically, it is most helpful when positions look simple.

Practical checklist during a game

Before calculating deeply, ask:

• Have I checked forcing moves?

• Do I have more than four candidates?

• Which move improves my worst piece?

• What does my opponent want?

This checklist alone prevents many blunders.

How to train the candidate moves method

1. Pause before every move

2. Write candidate moves when analysing games

3. Compare with engine suggestions

4. Practise slow games

Improvement comes from consistency, not speed.

Frequently asked questions

Is this method too advanced for beginners?

No. It simplifies thinking and reduces overwhelm.

How many candidate moves should I choose?

Usually two or three. Rarely more than four.

Does this slow me down?

At first, slightly. Long-term, it saves time.

Can I use this in blitz?

Yes. Even one candidate is better than none.

Do grandmasters still use this?

Yes—implicitly or explicitly.

Final thoughts

Chess is not about finding the perfect move every time.
It is about thinking well under uncertainty.

The candidate moves method gives your thinking structure, clarity, and direction. Once you adopt it, chess becomes calmer, more logical, and far more enjoyable.