Process
Candidate moves
You might say: shortlist, serious candidates
Candidate moves are the small shortlist worth calculating in a critical position. Start with forcing moves, then add a necessary defence or a strong positional move; compare the resulting positions instead of choosing from the whole legal move list.
- What it does
- Makes calculation finite and prevents an attractive first idea from becoming an untested decision.
- Ask
- Which two or three moves deserve a concrete line, and what opponent reply tests each one?
- Typical
- Usually a short list; the position decides whether defence or a quiet move belongs beside forcing moves.
- Trouble
- A player calculates one favourite move, or generates so many moves that no line is checked fully.
Pattern
Connections
- Made by: Forcing moves
- Controls: Variation
Sources
- Bryan Smith, Forcing Moves, Part 1, article
It should not be a very hard task, since there are only two candidate moves, and the opponent has a very limited response after each of them
- Bryan Smith, Forcing Moves, Part 1, article
It is pure calculation that allows a chess player to decide between these two moves.
Use it on your project
teardown-apply: hold "Candidate moves" (candidate-moves) from the teardown at https://teardownatlas.com/chess/ against my project
Paste it into a coding agent that has the teardown skills.
An AI agent wrote this map with the teardown skill. It can contain errors: check the sources before you rely on a part. About and legal