How the solutions work · counted by a rules engine
What a typical mate in 2 solution looks like
Sample: 25,000 mate in 2 puzzles (3.1% of all 804,429).
100% need 2 solver moves. Median rating: 1082 for the shortest solutions, 1082 for the longest.
43.6% open with a queen move. The first move captures in 28.4% and gives check in 99.4%; 100% end in checkmate, 23.1% involve a sacrifice, 51.8% have White to move.
28.4%first move captures
99.4%first move gives check
100%end in checkmate
23.1%involve a sacrifice
How many moves does the solver need?
2 solver moves
100% · median rating 1082
Which piece plays the key move?
Key move by a queen
43.6%
Key move by a rook
37.9%
Key move by a knight
8.1%
Key move by a bishop
6%
Key move by a pawn
4.2%
What does the solver win?
Most valuable capture: rook
32.5%
Captures nothing along the line
26.9%
Most valuable capture: pawn
20.2%
Most valuable capture: queen
8.6%
Most valuable capture: bishop
6.6%
Most valuable capture: knight
5.3%
Material balance along the whole line, counting every capture by both sides (pawn 1, minor piece 3, rook 5, queen 9):
No material gained (mating or positional)
46%
Up to 2 pawns’ worth
17.6%
3–4 points (about a minor piece)
9.3%
5–8 points (a rook or more)
19.3%
9 or more points (a queen’s worth)
7.9%
How much is left on the board?
28 or more pieces on the board
2.1%
21–27 pieces
24.7%
13–20 pieces
63.3%
12 pieces or fewer
9.9%
How it is counted: every puzzle in the sample is replayed move by move with a chess rules engine. A sacrifice means a piece that is captured on the very next ply and was worth more than what it captured itself (pawn 1, minor piece 3, rook 5, queen 9). Sample of 25,000 puzzles. Percentages are shares of the sample.
Where it happens
Where the key move lands
Where the solver’s first move ends, drawn from their own side (rank 1 is their back rank). Busiest squares: e8 (10.6%), d8 (10.2%), f7 (6.7%), f8 (6.2%), h7 (6.2%).
3.9
3.7
6.2
10.2
10.6
6.2
2.3
2.7
8
1.8
6.7
2
6.2
7
1
1.7
4.8
3.9
4.9
6
1
1.8
2
5
1.6
4
3
2
1
a
b
c
d
e
f
g
h
Counted from the same 25,000-puzzle sample. Squares under 1% are left blank.
In the chess glossary
What the glossary says
Forced mate
A sequence of two or more moves culminating in checkmate that the opponent cannot prevent.
Where this page comes from
The text above is adapted from
“Glossary of chess” on Wikipedia,
by its contributors. We kept only the definitions of the terms listed, removed citations, diagrams and navigation templates, and left the wording otherwise unchanged — nothing here was written or rewritten by AI.
The original is published under
CC BY-SA 4.0,
so this section is published under the same licence. You may share and
adapt it, including commercially, as long as you credit the original and keep the same
licence.
Puzzle positions, ratings and move sequences on this page come from real rated games (CC0 data), not from Wikipedia; theme write-ups and difficulty guides
elsewhere on this site are Chess Puzzle Print's own original work and are not covered by
this licence.
Study positions
The most-solved mate in 2 puzzles, from each difficulty level. Play each one on the board, then open the answer for the full line.
♜
♜
♟
♟
♛
♟
♚
♞
♟
♟
♙
♟
♟
♙
♙
♖
♙
♙
♙
♙
♙
♖
♕
♔
White to move · rating 966 · solved 15,731 times
· Mate in 2. It ends in checkmate on h7 with the queen. The solver captures a knight.Reveal line
Opponent's last move: gxf5
Solution: Qh6+ → Kh8 → Qxh7#
♚
♜
♟
♟
♟
♟
♘
♙
♙
♔
♙
♕
♖
♜
♛
White to move · rating 1131 · solved 15,716 times
· Mate in 2. It ends in checkmate on g8 with the queen.Reveal line
Opponent's last move: g6
Solution: Rd8+ → Kh7 → Qg8#
♜
♚
♜
♟
♟
♟
♟
♟
♟
♙
♙
♙
♙
♛
♙
♕
♙
♖
♔
White to move · rating 1165 · solved 16,829 times
· Mate in 2. It ends in checkmate on b8 with the rook. The solver captures a rook.Reveal line
Opponent's last move: Rxb8
Solution: Qh6+ → Kg8 → Rxb8#
♜
♚
♟
♟
♝
♟
♟
♟
♝
♟
♙
♞
♘
♙
♙
♙
♗
♘
♔
♕
♖
♛
♖
Black to move · rating 1289 · solved 7,044 times
· Mate in 2. It ends in checkmate on b2 with the queen. It gives up the rook (Rxb2+) on the way. The solver captures 2 pieces (knight, bishop).Reveal line
Opponent's last move: Kc2
Solution: Rxb2+ → Bxb2 → Qxb2#
♕
♟
♟
♚
♜
♖
♔
♙
♙
♛
Black to move · rating 1364 · solved 7,094 times
· Mate in 2. It ends in checkmate on f4 with the queen.Reveal line
Opponent's last move: e8=Q
Solution: Qf1+ → Kg3 → Qf4#
♟
♟
♟
♚
♟
♙
♕
♙
♛
♙
♜
♙
♜
♙
♖
♔
♖
Black to move · rating 1472 · solved 20,685 times
· Mate in 2. It ends in checkmate on h4 with the rook. It gives up the rook (Rxh3+) on the way. The solver captures a pawn.Reveal line
Opponent's last move: Rg1
Solution: Rxh3+ → Kxh3 → Rh4#
♛
♚
♟
♟
♙
♝
♟
♝
♟
♟
♙
♙
♕
♙
♙
♗
♙
♖
♔
Black to move · rating 1507 · solved 7,112 times
· Mate in 2. It ends in checkmate on f3 with the queen. The solver captures a queen.Reveal line
Opponent's last move: dxe6
Solution: Qa8+ → Qf3 → Qxf3#
♜
♜
♖
♟
♟
♚
♟
♘
♙
♙
♞
♕
♙
♛
♙
♔
White to move · rating 1640 · solved 3,583 times
· Mate in 2. It ends in checkmate on g4 with the knight.Reveal line
Opponent's last move: Kxh6
Solution: Qh4+ → Nh5 → Ng4#
♜
♚
♟
♟
♕
♟
♟
♜
♙
♘
♟
♔
♙
♙
♖
Black to move · rating 1655 · solved 3,557 times
· Mate in 2. It ends in checkmate on a4 with the rook. The solver captures a queen.Reveal line
Opponent's last move: Kxa2
Solution: Ra5+ → Qa4 → Rxa4#
♜
♜
♚
♟
♟
♕
♟
♙
♘
♟
♙
♛
♙
♙
♙
♔
♖
♖
Black to move · rating 1669 · solved 3,537 times
· Mate in 2. It ends in checkmate on e3 with the queen. It gives up the rook (Rxe4+) on the way. The solver captures a knight.Reveal line
Opponent's last move: Qxf7
Solution: Rxe4+ → fxe4 → Qe3#
♕
♜
♕
♟
♚
♟
♟
♙
♟
♙
♙
♙
♙
♙
♞
♛
♙
♔
♖
♖
Black to move · rating 2091 · solved 1,276 times
· Mate in 2. It ends in checkmate on h1 with the queen. It gives up the rook (Rxg3+) on the way. The solver captures 2 pieces (pawn, rook).Reveal line
Opponent's last move: a8=Q
Solution: Rxg3+ → Rxg3 → Qxh1#
♜
♝
♜
♚
♟
♟
♞
♕
♟
♟
♟
♝
♟
♟
♗
♙
♗
♘
♙
♛
♙
♙
♙
♘
♙
♙
♖
♞
♔
White to move · rating 2147 · solved 1,291 times
· Mate in 2. It ends in checkmate on f6 with the bishop. It gives up the queen (Qxf8+) on the way. The solver captures 2 pieces (rook, bishop).Reveal line
Opponent's last move: Bf6
Solution: Qxf8+ → Nxf8 → Bxf6#
Positions and move sequences come from real rated games (CC0 data). Engine evaluations, where shown, are stored evaluations of the position (CC0).
Background reading
Chess problem
A chess problem, also called a chess composition, is a puzzle created by the composer using chess pieces on a chessboard, which presents the solver with a particular task. For instance, a position may be given with the instruction that White is to move first, and checkmate Black in two moves against any possible defence. A chess problem fundamentally differs from over-the-board play in that the latter involves a struggle between Black and White, whereas the former involves a competition between the composer and the solver. Most positions which occur in a chess problem are unrealistic in the sense that they are very unlikely to occur in over-the-board play. There is a substantial amount of specialized jargon used in connection with chess problems.
Definition
The term chess problem is not sharply defined: there is no clear demarcation between chess compositions on the one hand and puzzle or tactical exercises on the other. In practice, however, the distinction is very clear. There are common characteristics shared by compositions in the problem section of chess magazines, in specialist chess problem magazines, and in collections of chess problems in book form.
Features
Not every chess problem has every one of these features, but most have several: * The position is composed – that is, it has not been taken from an actual game, but has been invented for the specific purpose of providing a problem. Although a constraint on orthodox chess problems is that the original position be reachable via a series of legal moves from the starting position, most problem positions would not arise in over-the-board play. * There is a specific stipulation, that is, a goal to be achieved; for example, to checkmate Black within a specified number of moves. * There is a theme (or combination of themes) that the problem has been composed to illustrate: chess problems typically instantiate particular ideas. * The problem exhibits economy in its construction: no greater force is employed than that required to render the problem sound (that is, to guarantee that the problem's intended solution is indeed a solution and that it is the problem's only solution). * The problem has aesthetic value. Problems are experienced not only as puzzles but as objects of beauty. This is closely related to the fact that problems are organised to exhibit clear ideas in as economical a manner as possible.
Tactical puzzles
Problems can be contrasted with tactical puzzles often found in chess columns or magazines in which the task is to find the best move or sequence of moves (usually leading to mate or gain of material) from a given position. Such puzzles are often taken from actual games, or at least have positions which look as if they could have arisen during a game, and are used for instructional purposes. Most such puzzles fail to exhibit the above features.
Types of problems
There are various different types of chess problems: *Directmates: White to move first and checkmate Black within a specified number of moves against any defence. These are often referred to as "mate in n", where n is the number of moves within which mate must be delivered. In composing and solving competitions, directmates are further broken down into three classes: **Two-movers: White to move and checkmate Black in two moves against any defence. **Three-movers: White to move and checkmate Black in no more than three moves against any defence. **More-movers: White to move and checkmate Black in n moves against any defence, where n is some particular number greater than three. **Many-movers: White to move and checkmate Black in a great number of moves. Problems have been composed in which White must mate Black in over 100 moves; the current record for such a composition is over 200 moves. These usually involve frequent repetitions of the same manoeuvre in order to force detrimental pawn advances. *Helpmates: Black to move first cooperates with White to get Black's own king mated in a specified number of moves. *Selfmates: White moves first and forces Black (in a specified number of moves) to checkmate White. *Helpselfmates: White to move first cooperates with Black to get a position of selfmate in one move. *Reflexmates: a form of selfmate with the added stipulation that each side must give mate if it is able to do so. When this stipulation applies only to Black, it is a semi-reflexmate. *Seriesmovers: one side makes a series of moves without reply to achieve a stipulated aim. Check may not be given except on the last move. A seriesmover may take various forms: **Seriesmate: a directmate with White playing a series of moves without reply to checkmate Black. **Serieshelpmate: a helpmate in which Black plays a series of moves without reply after which White plays one move to checkmate Black. **Seriesselfmate: a selfmate in which White plays a series of moves leading to a position in which Black is forced to give mate. **Seriesreflexmate: a reflexmate in which White plays a series of moves leading to a position in which Black can, and therefore must, give mate. *Studies: an orthodox problem in which the stipulation is that White to play must win or draw. Almost all studies are endgame positions. Studies are composed chess problems, but because their stipulation is open-ended (the win or draw does not have to be achieved within any particular number of moves) they are usually thought of as distinct from problems and as a form of composition that is closer to the puzzles of interest to over-the-board players. Indeed, composed studies have often extended our knowledge of endgame theory. But again, there is no clear dividing line between the two kinds of positions. In all the above types of problem, castling is assumed to be allowed unless it can be proved by retrograde analysis (see below) that the rook in question or king must have previously moved. En passant captures, on the other hand, are assumed not to be legal, unless it can be proved that the pawn to be captured must have moved two squares on the previous move. There are several other types of chess problem which do not fall into any of the above categories. Some of these are really coded mathematical problems, expressed using the geometry and pieces of the chessboard. A famous such problem is the knight's tour, in which one is to determine the path of a knight that visits each square of the board exactly once. Another is the eight queens problem, in which eight queens are to be placed on the board so that none is attacking any of the others. Of far greater relation to standard chess problems, however, are the following, which have a rich history and have been revisited many times, with magazines, books and prizes dedicated to them: *Retrograde analysis problems: such problems, often also called retros, typically present the solver with a diagram position and a question. In order to answer the question, the solver must work out the history of the position, that is, must work backwards from the given position to the previous move or moves that have been played. A problem employing retrograde analysis may, for example, present a position and ask questions like "What was White's last move?", "Has the bishop on c1 moved?", "Is the black knight actually a promoted pawn?", "Can White castle?", etc. Some retrograde analysis may also have to be employed in more conventional problems (directmates and so on) to determine, for example, whether an en passant pawn capture or castling is possible. The most important subset of retro problems are: **Shortest proof games: the solver is given a position and must construct a game, starting from the normal game array, which ends in that position. The two sides cooperate to reach the position, but all moves must be legal. Usually the number of moves required to reach the position is given, though sometimes the task is simply to reach the given position in the smallest number of moves. *Construction tasks: no diagram is given in construction tasks; instead, the aim is to construct a game or position with certain features. For example, Sam Loyd devised the problem: "Construct a game which ends with black delivering discovered checkmate on move four" (published in Le Sphinx, 1866 – the solution is 1.f3 e5 2.Kf2 h5 3.Kg3 h4+ 4.Kg4 d5#); while all White moves are unique (see Beauty in chess problems), the Black ones are not. A unique problem is: "Construct a game with black b-pawn checkmating on move four" (from Shortest construction tasks map in External links section; the unique solution is 1.d4 c6 2.Kd2 Qa5+ 3.Kd3 Qa3+ 4.Kc4 b5#). Some construction tasks ask for a maximum or minimum number of effects to be arranged, for example a game with the maximum possible number of consecutive discovered checks, or a position in which all sixteen pieces control the minimum number of squares. A special class are games uniquely determined by their last move like "3...Rxe5+" or "4...b5#" from above. Across most of the above genres, there is great interest in exploring fairy chess, in which non-standard boards, pieces or rules apply.
Beauty in chess problems
The role of aesthetic evaluation in the appreciation of chess problems is very significant, and indeed most composers and solvers consider such compositions to be an art form. Vladimir Nabokov wrote about the "originality, invention, conciseness, harmony, complexity, and splendid insincerity" of creating chess problems and spent considerable time doing so. There are no official standards by which to distinguish a beautiful problem from a poor one and such judgments can vary from individual to individual as well as from generation to generation. Such variation is to be expected when it comes to aesthetic appraisal. Nevertheless, modern taste generally recognises the following elements to be important in the aesthetic evaluation of a problem: *The problem position must be legal. That is to say, the diagram must be reachable by legal moves beginning with the initial game array. It is not considered a defect if the diagram can only be reached via a game containing what over-the-board players would consider gross blunders. *The first move of the problem's solution (the key move or key) must be unique. A problem which has two keys is said to be cooked and is judged to be unsound or defective. (Exceptions are problems which are composed to have more than one solution which are thematically related to one another in some way; this type of problem is particularly common in helpmates.) *Ideally, in directmates, there should be a unique White move after each Black move. A choice of White moves (other than the key) is a dual. Duals are often tolerated if the problem is strong in other regards and if the duals occur in lines of play that are subsidiary to the main theme. *The solution should illustrate a theme or themes, rather than emerging from disjointed calculation. Many of the more common themes have been given names by problemists (see chess problem terminology for a list). *The key move of the solution should not be obvious. Obvious moves such as checks, captures, and (in directmates) moves which restrict the movement of the black king make for bad keys. Keys which deprive the black king of some squares to which it could initially move (flight squares), but at the same time make available an equal or greater number of flight squares are acceptable. Key moves which prevent the enemy from playing a checking move are also undesirable, particularly in cases where there is no mate provided after the checking move. In general, the weaker (in terms of ordinary over-the-board play) the key move is the less obvious it will be, and hence the more highly prized it will be. *There should be no promoted pawns in the initial position. For example, if White has three knights, one of them must clearly have been promoted; the same is true of two light-square bishops. There are more subtle cases: if f1 is empty, a white bishop stands on b5 and there are white pawns on e2 and g2, then the bishop must be a promoted pawn (there is no way the original bishop could have gotten past those unmoved pawns). A piece such as this, which does not leave a player with pieces additional to those at the start of a game, but which nonetheless must have been promoted, is called obtrusive. The presence of obtrusive units constitutes a smaller flaw than the presence of more obviously promoted units. *The problem should be economical. There are several facets to this desideratum. For one thing, every piece on the board should serve a purpose, either to enable the actual solution, or to exclude alternative solutions. Extra units should not be added to create "red herrings" (this is called dressing the board), except in rare cases where this is part of the theme. If the theme can be shown with fewer total units, it should be. For another, the problem should not employ more moves than is needed to exhibit the particular theme(s) at its heart; if the theme can be shown in fewer moves, it should be.
Where this page comes from
The text above is adapted from
“Chess problem” on Wikipedia,
by its contributors. We removed reference markers, infoboxes, templates and embedded
media, and kept the prose sections otherwise intact — nothing here was written or
rewritten by AI.
The original is published under
CC BY-SA 4.0,
so this section is published under the same licence. You may share and
adapt it, including commercially, as long as you credit the original and keep the same
licence.
Puzzle positions, ratings and move sequences on this page come from real rated games (CC0 data), not from Wikipedia; theme write-ups and difficulty guides
elsewhere on this site are Chess Puzzle Print's own original work and are not covered by
this licence.