Pins, forks, and skewers describe relationships among pieces, but recognizing the label is only the start; the move must be legal and survive the opponent's best response. FIDE defines movement, attack, check, and legal moves. The motif names are practical chess vocabulary, and engine move-generation techniques are software methods rather than formal definitions of tactical success.
Who this is for: Beginning and intermediate chess players learning to verify common tactical motifs instead of naming them by appearance alone.
- For pins, forks, and skewers, separate binding rules from practical principles, software conventions, and optional training methods before making a decision.
- Name the attacker, each target, the geometric relationship, and the consequence you expect. Generate the defender's forcing replies before counting a gain. For king-related pins, distinguish legal immobility from a relative pin where moving is legal but may lose material. Record the position, information, or assumptions so the reasoning can be checked instead of reconstructed from memory.
- Tactical labels compress information and can hide exceptions. Two attacked pieces are not automatically both lost, and a higher nominal piece value does not settle positions involving mate, promotion, or compensation. Any values used during analysis are heuristics, not FIDE scores. Treat every numeric score, resource count, or probability in this guide as hypothetical unless it comes directly from the stated position or calculation.
Define the problem precisely
A pin occurs when moving one piece would expose a more important target behind it; if that target is the king, a move exposing check is illegal. A skewer attacks a more valuable front piece so that moving it may expose a rear target. A fork is one piece attacking two or more targets at once.
Trace the exact line or attack pattern and identify every blocker. Then ask whether the attacker can be captured, whether one reply saves both targets, whether a countercheck changes the move order, and whether the supposedly pinned piece has a legal move along the pin line or can capture the attacker.
Use a repeatable process
Name the attacker, each target, the geometric relationship, and the consequence you expect. Generate the defender's forcing replies before counting a gain. For king-related pins, distinguish legal immobility from a relative pin where moving is legal but may lose material.
Use motifs to generate candidates, not to certify them. A knight fork may win nothing if the knight is trapped or the attack is met by checkmate elsewhere. A skewer may exchange equal pieces rather than win material. Calculate the complete sequence to a stable position.
Know what the result means
Tactical labels compress information and can hide exceptions. Two attacked pieces are not automatically both lost, and a higher nominal piece value does not settle positions involving mate, promotion, or compensation. Any values used during analysis are heuristics, not FIDE scores.
An absolute pin to a king has a legal consequence because the king may not be left in check. A relative pin is a practical relationship. A program can generate pseudo-legal moves and later filter illegal ones, but that engine convention does not permit such moves in an actual game.
Review and transfer the skill
Build a motif notebook around failed predictions rather than decorative examples. Record the first defensive resource that changed the result, such as capturing the attacker, moving with tempo, interposing, or creating a stronger threat. Re-solve from the unlabelled position later.
Search for the same relationships in defense. If your queen and king align on a file, anticipate a pin or skewer before it appears. Pattern recognition becomes useful when it prompts a timely legal and tactical check rather than an automatic move.
Worked example: pins, forks, and skewers
Imagine a hypothetical legal position where a bishop attacks a knight, with a queen behind the knight on the same diagonal. The relationship resembles a relative pin because the rear target is not the king, but the outcome depends on all legal resources.
- Identify the bishop as attacker, the knight as front piece, and the queen as rear target, then verify that no blocker interrupts the diagonal.
- Check whether the knight can capture the bishop, move with check, defend the queen, or uncover a counterattack stronger than the expected loss.
- Check whether the defending side can move the queen first or interpose another piece on a later move.
- Calculate the most resistant line and describe the actual result instead of writing only the word pin.
pins, forks, and skewers worksheet
Use this reusable record to make the evidence and decisions behind pins, forks, and skewers visible for later review.
- Motif candidate, attacking piece, front target, rear target, and all intervening squares.
- Whether a king is involved and which candidate moves would expose illegal check.
- Captures of the attacker, counterchecks, interpositions, and moves that protect both targets.
- Resulting material, king safety, promotion threats, and escape squares after the sequence.
- Motif label after verification, strongest defense found, and correction if the label misled.
Common mistakes
- Calling every aligned pair a pin without identifying what moving the front piece would actually expose.
- Assuming a fork wins the most valuable attacked piece without checking captures or forcing counterplay.
- Treating pseudo-legal engine move generation as evidence that a pinned piece may expose its own king in play.
Try one
A knight attacks a rook and queen at once, but the queen can capture the knight safely. What does the fork label establish?
It establishes only the attack relationship. Because the knight can be captured safely, the expected material gain may disappear. Calculate that capture and any recapture or countercheck before deciding whether the fork has a favorable result.
Sources
- FIDE Laws of ChessFIDE's formal Laws of Chess, used here only for rules that govern orthodox chess play.
- Chess Programming Wiki: Move GenerationA programming reference for generating legal or pseudo-legal chess moves, not a substitute for the FIDE Laws.