Endgames in Fog of War Chess
Abstract
Fog of War chess is a popular variant of classical chess, in which both players have only partial information about the position of the opponent’s pieces. This study provides the first theoretical analysis of endgames in Fog of War chess. In particular, we analyze the setups king and queen versus king, king and rook versus king, and king and two rooks versus king. We show that a king and queen can always guarantee a win against a lone king. In contrast to classical chess, a king and a rook cannot guarantee a win against a lone king. However, adding one more rook guarantees a win.
Keywords and phrases:
Chess, Endgame, King, Queen, RookCopyright and License:
2012 ACM Subject Classification:
Theory of computation Solution concepts in game theoryEditor:
John IaconoSeries and Publisher:
Leibniz International Proceedings in Informatics, Schloss Dagstuhl – Leibniz-Zentrum für Informatik
1 Introduction
Fog of War chess, also known as Dark chess, is a variant of the popular board game chess, where each player can only see the squares to which their pieces can legally move. The game was invented by Jens Bæk Nielsen and Torben Osted in 1989 [9] and is based on Kriegspiel, which is the first variant of chess with limited information, introduced in 1899 [10].
The aspect of imperfect information adds uncertainty to the game, as players must make decisions based on incomplete information about their opponent’s pieces and positions. Recently, in June 2025, the design of an AI-strategy is described, also first theoretical thoughts about the scenario of one king versus another king are mentioned [10]. Even in the wider social and cultural context, Fog of War chess is recognized: Notably, on the popular chess website chess.com, tens of thousands of players actively play Fog of War chess, making it one of the most popular chess variants [2]. World-class players such as Hikaru Nakamura are known for playing the variant [8], and it has also gained a lot of traction online with millions of views [6].
Also, other games for which imperfect information plays an important role have already been studied in the past, including minesweeper [7], tetris [5], or other video games [3].
In this article, we will study endgames in Fog of War chess from a theoretical perspective:
The main contribution therefore, is three different endgames in Fog of War chess, where we show which combination of pieces can guarantee a win against a lone king.
First, we will introduce the rules of Fog of War chess, including some terminology.
In the three following sections, we analyze which pieces are sufficient to guarantee a win against a lone king, given the opponent’s initial king position, but without knowledge of their subsequent moves. We will first show that a king and queen can always guarantee a win. After that, we consider the setup king and rook versus a king. We will show that there are starting positions where the player with the rook cannot guarantee a win. This is in contrast to classical chess, where a king and rook can always win against a lone king, given he starts and plays optimally [4]. Lastly, we consider the setup king and two rooks versus a king. We will show that the player with the two rooks can guarantee a win.
We conclude this article with some open questions.
1.1 Rules
The rules of Fog of War chess are similar to those of classical chess [10]. The chess pieces move as in classical chess. The imperfect information changes the game as follows:
-
The players observe only the squares their pieces can legally move to, after each move.
-
There is no check or checkmate; a player wins by taking the opponent’s king. Thus,
-
–
if one player moves into a check with its king, then this is legal, but immediately loses the game, as there is no better move for the opponent than taking the opponent’s king.
-
–
there is no stalemate, particularly if one player can only move to a square which is attacked by the opponent, and it is his turn, he loses.
-
–
-
A draw does not have to be claimed. In particular, a threefold repetition and the draw after 50 moves without a pawn move or capture must be enforced by the game host.
-
There are additional rules for pawns:
-
–
If a pawn’s forward move is blocked by a piece, then it cannot observe that piece. But of course, he then knows that there is an opponent’s piece in front of him.
-
–
En passant is allowed; therefore, if a pawn can do so, the opponent’s pawn is visible.
-
–
Within this study, the pawn rules are not relevant; furthermore, we ignore the draw rules.
If White has a winning strategy, he must win regardless of how the Black king moves. As the Black king might be lucky and always guess the right move, we may assume that Black knows the board and can play adversarial.
1.2 Notation
We use the classic chess notation to refer to squares on the board as depicted in figure 1.
The file of the chessboard is its column (), while the rank is its row () [1]. We call a square an edge- or a corner square, when it is at the edge (resp. corner) of the board. Without loss of generality, we will present strategies for White for the rest of this article. With, e.g., , we denote the set of all squares on the rectangle between and . A configuration is the position of all pieces on the board.
2 Queen and King vs. King
In classical chess, a player with a queen and a king can always force a win against a lone king [4]. In this section, we will show that this is also possible in Fog of War Chess:
We will present a strategy for White that guarantees a win for any given configuration and regardless of Black’s moves. Therefore, we need to show that White’s strategy holds for any move Black performs. This may lead to multiple possible positions of the Black king, of which White does not know where exactly Black is.
The winning strategy for White proceeds in two stages:
-
1.
White moves its king onto a corner square (, , , or ) and places the queen on an adjacent square. So if the white king is on , then the queen is placed on either , , or . We call this a corner configuration.
-
2.
White gradually reduces the set of squares available for the opponent’s king until capture becomes inevitable. This is done by pushing the opponent’s king towards an edge.
2.1 Preparing Observations
We begin with a number of observations laying the ground for the winning strategy.
First, we note that whenever the opponent’s king can be captured, White should do so. This implies that as long as the White king or queen are not moved, they cannot be captured in the next round, as they would have been able to capture the Black king before.
Secondly, the queen can always move around their own king without risk of losing it.
Lemma 1.
If the queen is adjacent to her own king, the queen can reach any other square adjacent to the white king. If the queen gets captured, White wins immediately.
Proof.
Whenever the queen moves to a square adjacent to their own king, she cannot be captured. If Blacks king were to capture her, then he has moved his king to a place adjacent to the White king. As the next move is from White, he will capture the Black king with his own king and therefore win. It is also easy to see that White needs at most two moves to move its queen from one square adjacent to their king to another square.
2.2 Stage 1: Achieving the corner configuration
Our goal is to reach the corner configuration in finitely many moves.
The objective of moving the White king to a corner and the queen to an adjacent square can be divided into different cases: If the white king is initially on one of the central squares (, , , or ), then the first step is to move him out of the center. Once the white king leaves the center, or if he initially does not start on a square in the center, we move the queen to an adjacent square. Finally, we coordinate whites figures to reach the corner configuration.
We begin by proving the last step: if the white king is not in the middle of the board and the queen is located on an adjacent square, then the corner configuration can be reached.
Lemma 2.
The White player has a king and a queen. The Black player only has a king. It is White’s turn to move. The Black king can be on any square of the board.
Suppose the White king is not on one of the central squares , , , or , and the White queen is on a square adjacent to her king. Then either
-
the corner configuration can be reached in finitely many moves, or
-
White wins.
Proof.
Note that the maximum distance of the king to the nearest edge is at most two:
Case 1: Distance two from the edge.
Let the king be on , other cases are analogous. We proceed as follows:
-
0.
If the queen is not already on , then move her there. After this, the opponent’s king cannot be on any of the squares , , , , or .
-
1.
Next, move the queen to . Again, she cannot be captured, as the opponent’s king cannot be on any of the squares adjacent to where she moves, and now the opponent’s king is also excluded from , , , , , and , .
-
2.
Now advance the king to . Afterwards, the king is only one move away from the edge.
Case 2: Distance one from the edge.
Once the king is within one step of the edge, he can continue without further assistance from the queen. Eventually, the king reaches the edge itself. Note that the queen cannot be on as this would block the king from moving there, but can be placed on any other adjacent square of the king (such as ). After moving the king to the edge, the queen can be moved to an adjacent square of the king within one move.
Case 3: The king is at the edge.
From there, we guide the king into a corner. Suppose the king is on , other cases are similar. We move the queen to , enabling the king to step downwards to . Next, move the queen to , after which the king descends to and finally to . In the end, the queen moves to , yielding to the corner configuration.
Now, we return to the initial step of moving the king out of the center, if necessary. We show that it is always possible to move him outside the central squares and position the queen adjacent to him. This allows us to invoke Lemma 2.
Lemma 3 (Ensuring a Safe Way).
Let the White king be on one of the central squares , White controls a queen, and the sole remaining Black piece is a king (whose initial position is known). It is White’s turn to move.
Without loss of generality, White can either place its king on while ensuring that Black’s king is on before the next move of White, or win.
Proof.
Suppose the White king is on square by symmetry.
If the Black king is not already in , we can move our king and achieve our desired configuration up to symmetry:
-
If the Black king is anywhere on the squares , then
-
–
If the Black king is on , then take him.
-
–
Otherwise: try to move the White king to if not blocked by the queen.
-
*
If the queen is on , then move the king to : the king is not in the center, and the queen is adjacent to him, letting us invoke Lemma 2.
-
*
Otherwise: move the White king to . It is Black’s turn to move. If he moves, then he can only move to any square from . Rotating the board yields the desired result.
-
*
-
–
-
If the Black king is on the squares , this is analogous to the previous case.
-
If the Black king is on the squares , then we can use a similar strategy.
-
–
If the Black king can be taken, White does so.
-
–
Otherwise: try to move the White king to if not blocked by the queen.
-
*
If the queen is on that square, first move to and then to , which can be done without a risk of capture. Again, we can continue with Lemma 2.
-
*
Otherwise: move the king to , then it is Black’s turn. If he moves, then he can only safely move to any square from except the squares adjacent to the White king. Rotate the board by 180 degrees, and we have reached the goal.
-
*
-
–
Given such a configuration, we can safely move the king to any square up-left of the board, as the Black king cannot outpace the White king.
Lemma 4 (Move away from the center).
Let the White king be on , White controls a queen, and the Black king is in . It is White’s turn to move.
Then White can either reach the corner configuration or win.
Proof.
We now want to move our king, such that the queen can move to an adjacent square of the king on the next move without the risk of being captured. To ensure this, we make a case distinction based on the position of the White queen.
Case 1: Queen on .
Then White moves the king to . This maneuver is safe because the Black king cannot outpace the White king, as he started in the lower-right part of the board. From there, the queen can reach a square adjacent to the king within one move.
Case 2: Let the queen initially be on any other square.
If the queen is on or , then move the king to , then the queen is adjacent to the king, who is outside the center.
Otherwise, we move the White king to . This maneuver is safe because the Black king cannot outpace the White king, as he started in the lower-right part of the board. Moreover, the queen can then be repositioned onto a square adjacent to the king within one move.
Note that if the intended path is obstructed by the Black king, then White can capture the king with the queen.
It remains to consider the case where the king is not in the center of the board, and the queen is not yet adjacent to the king. We must show, that the queen can safely be brought to a square adjacent to her king. Once achieving this, Lemma 2 applies.
Lemma 5.
Let the White player have a king not on a central square and a queen; the Black player only a king. It is White’s turn. The initial position of the Black king is known.
Then either the White queen can be moved to a square adjacent to the White king within at most two moves, without being captured, or White wins.
Proof.
If the opponent’s king can be captured by the queen (or by the king), White captures and wins. If there exists an adjacent square to the White king that the queen can reach in one move, White plays that move, and the condition is fulfilled in a single move.
Otherwise, assume without loss of generality (by rotation) that the queen is located in the upper-right part relative to the king. Let the White king be at and the queen at with . Choose as a target the square (up-right from the king).
From to there are (at least) two possible routes, each consisting of a horizontal and a vertical (rook-like) move:
Since the position of the Black king is known, White can choose the route whose first waypoint is not adjacent to the Black king. If both waypoints and were adjacent to the Black king, then the Black king would necessarily be at , thereby controlling the squares . In this case, the queen would have to be located at one of in order for both waypoints to be threatened. But these positions are themselves adjacent to , where the queen can immediately capture the Black king.
Corollary 6.
Starting from any position in which White controls a king and queen and moves first against a lone Black king, and White knows the Black king’s initial position, it is always possible (in finitely many moves) to reach the corner configuration or to win.
Note that the knowledge of Blacks initial position is crucial: even if Whites figures are adjacent to each other, White will not be able to safely move its own king from the center to a corner (as in Lemma 4). If White starts already in a corner configuration, knowing the initial position of Black is not necessary.
2.3 Stage 2: Push the Black king to the edge, line by line
We now show that it is possible to systematically reduce the cardinality of the set of squares available to the lone Black king. The reduction proceeds line by line (either rank or file), beginning with line 1 and 2. For all proofs in this part, we can assume that White starts, as black can start on an arbitrary position (within the given restrictions).
Lemma 7.
White controls a king and a queen in a corner configuration, Black has a king.
Then Black can be restricted to a area, or White wins.
Proof.
Let the White king be on and the queen on . Use the following strategy:
-
1.
Move the queen one square to the right (first to ). She is protected by the White king, so if she is taken, White wins.
-
2.
Move the White king to the right. This move is safe as all adjacent positions are visible due to the queen on the position above.
-
3.
Repeat steps (1.), (2.) until the queen reaches .
This procedure works for the following reasons:
-
If the Black king is on line 2, , then the queen can take him and White wins.
-
If the Black king is on line 1, , then the queen will discover him. If the Black king moves further to the right, at some point, he is stuck and can be taken by the queen. If he takes the queen, then the White king takes and White wins.
Afterwards, the Black king is not on the first or second rank, namely .
We now continue by reducing the number of possible squares available to the Black’s king, line by line, until he must be placed on the last three lines. For this, let the Black king be located on an arbitrary position within .
First, we move the queen and the king one step at a time to the right, until the queen sees the Black king. If the queen sees the Black king, the king can be forced upwards:
Lemma 8.
Let the White player have a king and a queen, and the Black player only a king. The White queen is adjacent to her own king. The Black king is located in a area, which is restricted by the queen.
Then White can either win the game or force the Black king upwards until restricting him to a square field.
We show the procedure from rank 5 and above to 6 and above; the other cases are identical.
Proof.
Suppose that the White queen is located on position and her king is on , and the Black king is located on an arbitrary square . Other configurations are similar.
The strategy proceeds in two phases:
-
First, we move the queen and the king to the right, one step at a time, until the queen sees the Black king above her.
-
Once the queen sees the Black king, we force him upwards, ultimately restricting him to a area, namely .
It is White’s turn to move. White follows the strategy below:
-
1.
If White sees the Black king, then he captures immediately.
-
2.
Otherwise, if the Black king is unseen, White follows a fixed sequence of moves as illustrated in Figure 7.
-
3.
If for or we see the Black king in the same file as the queen, we move the king diagonally up-right, then follow with the queen one square up.
-
4.
If for we see the Black king in the same file as the queen, we move the king diagonally up-left, then follow with the queen one square up.
Correctness.
We now prove the reduction of the Black king’s possible positions:
-
In the trivial cases (Black king is directly visible, or captures the queen), White either wins by immediate capture or recaptures with the king (the queen is always protected).
-
At , we consider again where the Black king can move, after the White queen saw the king. He can only move to , , or , , . As we move the White king, the Black king can go to , , , , and the former squares (not , as this is blocked by the White king). White moves the queen one square down, and it is covered by the Black king. If the Black king is on ( respectively), then he has only two files left. Otherwise, he has three ranks left. The cases and work identically, they also reduce the files to at most three. In the case the Black king might escape to the bottom left side, but this will be visible to White when the White queen moves up. Then Black is restricted to the three rightmost files.
-
The case to is identical up to symmetry; but needs to be dealt mirrored as then the three files to the right side can be guaranteed.
-
If the Black king was not seen at least at , then he must be on the rightmost three files, and we restrict his field to with the queen.
In the following, we will show how to reduce the number of lines from three to two:
Lemma 9.
Let the Black king be located on an arbitrary square within a area. The White player has a king and a queen, and the Black player only a king. The White queen is adjacent to her own king and restricts the Black king to the field.
Then White can either win the game or restrict the Black king to squares.
Proof.
We use a similar strategy by moving the White pieces to the right, until the queen sees the Black king. Then we force him upwards, restricting his position to a area.
Let the White queen be located on position and her king be on , and the Black king be located on an arbitrary square . We only consider the moves of the queen moving from to , as to are analogous by symmetry.
-
If White sees the Black king on the -file, then take.
-
If this is not the case, White moves the Queen to .
-
Then White might see the opponent (queen on ).
-
–
If White sees the opponent on the -file, then it is Black’s turn. Black moves to either , , , or . Then White moves the king upright to and thereby blocks . Black can now be on any of the squares before or on . Move the queen up, and the Black king is restricted to the 7th and 8th rank.
-
–
Otherwise, White moves the king to the right, and then the queen one square to the right.
-
–
-
Then White might see the opponent (queen on ).
-
–
If White sees the Black king on the -file, then Black can move to , , , or . Then White moves the king upright, and Black can also be on to , , . White then moves the queen one square up.
-
*
If the queen does not see the Black king on ; Black is on the 7th or 8th rank.
-
*
If the Black king is on ; Black has only two files left, reaching our goal.
-
*
-
–
Otherwise, White moves the king and then the queen to the right.
-
–
-
White might now see the opponent (queen on ).
-
–
If White sees the opponent on the -rank, then move the Black king up-right, then the opponent might be on , , , , , , or (as is covered by the White king). Then move the queen up.
-
*
If the queen sees the Black king on , then we can apply the case above (queen on ), but with the board rotated/mirrored.
-
*
Otherwise, the Black king is on the 7th or 8th rank, restricted by the queen.
-
*
-
–
Otherwise, move the king and then the queen to the right.
-
–
The remaining cases are analogous (differing just in moving the White king up-left).
Hence, White can always force the Black king to the last and second-last rank, or win.
We now want to force the Black king to have only one rank (or file) left.
Lemma 10.
Let the Black king be located within a restricted area. The White player has a king and a queen, and the Black player only a king. The White queen is adjacent to her own king. The queen restricts the Black king to this area.
Then White can either win the game or force the Black king to a area.
Proof.
As in the lemmas before, we will move the king and the queen to the right. Again, the queen will eventually see the Black king on a field above her (which must be in the topmost line in this case). Assume the White queen sees the king on square
-
1.
. Take the Black king, as it is White’s turn.
-
2.
. Move the king up-right in the next turn. This leads to a stalemate, with the Black king to play; therefore, Black will be taken in the next move.
-
3.
. Again, move the king upright. The Black king can only be on (or taken), thus we move the queen to and follow with the king. Thus, Black is restricted to file A.
-
4.
. Black moves to either or . Then White moves the king upright. We do not move the queen up! If the opponent is on , then he moves into a square which is covered by White, leading to a victory of White. Otherwise, if the Black king is not on , then he is on , and must move in the next move. Thus, White can move its king to , forcing Black to . Queen now restricts Black to the A-file.
Hence, we can force the Black king to the last rank or win.
Only one line is left; we now show a strategy that guarantees a win for White.
Lemma 11.
Let the Black king be located within a area. The White player has a king and a queen, and the Black player only a king. It is White’s turn to move. The White queen is adjacent to her own king. The queen restricts the Black king to this area. In particular, if the White queen does not move, the Black king cannot leave this area.
Then there exists a deterministic strategy for White that wins the game.
Proof.
We start with the queen on and the king on . The Black king is on .
We move the queen gradually to the right, while the king follows her. If White sees the opponent, he can escape to the right until he eventually he runs out squares and loses.
Corollary 12.
If the player with the queen starts and plays according to the strategy outlined in this section, then he can always win against the player with only a king, given he knows the initial position of the opponent’s king and starts.
Therefore, the player with the queen can always win against the player with only a king.
3 Rook and King vs. King
In this section, we will show that a player with the rook does not always have a winning strategy against a player with only a king. This differs from classical chess, where a player with a rook can always force a win if he starts [4]!
In other words, there exists a configuration (starting position of the pieces), such that for any strategy of the player with the rook, there always exists a move for the player with only a king, such that he does not lose. As in the section above, we assume that White has material advantage, knows the initial position of Black, and starts.
A first observation is that if Black captures a rook which not immediately covered, White will no longer have chances to win (as Black knows the White position).
The proof can be divided into two parts: First, we will show that Blacks king cannot be taken if he is not at an edge. After that, we will show that he cannot be pushed to an edge.
We claim that if the Black king is not at an edge, he cannot be taken in the next move:
Lemma 13.
Let it be Black’s turn. And let the Black king be anywhere not on the edge of the board, i.e. . Then White cannot win in his next move.
Proof.
Assume White wins in his next move. Therefore, White must achieve either a stalemate or checkmate (as Black does not move voluntarily into a square covered by White):
As Black is not at the edge of the board, White has to cover all eight squares adjacent to the Black king. However, the rook can only cover four squares, the White king only three (when not directly adjacent to the Black king, here Black would win immediately):
It remains to show that Black cannot be pushed to an edge. To do so, we will start with three technical lemmas that describing situations which can be forced by Black.
In three situations, the Black king will be forced out of the safe space, and can not directly return. Here, however, the Black king can always move to a cluster of squares, from which he can either return to the safe space, capture material of White (leading to a draw or victory for Black), or the cluster of squares reoccurs (thus Black survives in an endless loop).
We start with an important lemma, which we will use multiple times in the following.
Lemma 14 (***).
Let the Black king be in one of the following clusters of squares:
-
1.
, , ,
-
2.
, , ,
-
3.
, , ,
Let the White king and the White rook be anywhere outside (1), (2), or (3), and they do not cover any of the clusters where the Black king is located. Assume that it is White’s turn, then either the lemma reoccurs, Black captures a piece of White, or moves to the safe space.
Proof.
White is to move.
-
If White moves the king, then the square combinations (1), (2), or (3) sustain themselves, or Black can take the White king. If the White king moves to the or file (which is safe when the rook covers resp. ) and blocks squares of some clusters; note that the rook cannot be protected by the king when moving to the left or right on line and will be caught, and that the Black king can advance to a safe space when the rook moves on other lines. Thus, the White king stays behind and covers the rook.
-
If White moves the rook
-
1.
left or right, it might uncover the Black kings location if placed between the to file. In any case, Black can in its next turn move the king to any square of another, undiscovered cluster. If the rook moves to the or file, we can assume that the Black king was in the invisible file. Then, or if the rook moves to the or -file, Black can move the king. If, e.g, the rook is moved to , then
-
(a)
if the Black king is in (2) or in (3), the Black king is on . The Black king then moves into cluster (1), and this lemma reapplies.
-
(b)
if the Black king is in (1), the Black king can stay there, and the assumptions remain unchanged.
-
(a)
-
2.
If the rook moves down to , then move the Black king to the safe space, here: , which is adjacent to (1), (2), and (3). This is possible because the White king can cover at most or . If the rook blocks the last one ( or ), the Black king can capture the rook or move to the safe space.
-
3.
If the rook moves up or down to , the Black king can remain in his cluster.
-
1.
Thus, either this lemma reoccurs, Black captures a piece, or moves to the safe space.
Lemma 15 (*).
If the Black king is on or , it is White’s turn, the White king is on , and the rook is on but not on . Then either this lemma reoccurs, Black captures a White piece, moves back to the safe space, or Lemma 14 occurs.
Proof (Case distinction).
-
1.
Moving the king leads to the capture of it, or Black moves to the safe space ().
-
2.
Moving the rook to the right or up allows us to reapply this Lemma.
-
3.
Move the rook left to the -file. Black then might not have been on the now visible squares, but might be on . It is now Black’s turn, and the uncertainty extends to , . Thus, Lemma 14 applies.
-
4.
Moving the rook down can be treated analogously to (3) or by symmetry.
Lemma 16 (**).
Let it be White’s turn with the White king be on any square of (not adjacent to the Black king) and the rook on any on the squares of . Let the Black king be anywhere on . Then either this lemma reoccurs, Black captures a piece of White, or leads to Lemma 14.
Proof (Case distinction).
-
1.
Let the White king be on any square in ranks 5–8 .
-
(a)
If the rook is on :
-
If the king is moved, the Black king can remain everywhere on and this lemma reapplies.
-
Moving the rook
-
–
up or down allows Black to return to the safe space.
-
–
left or right; then either the rook can be captured, or the Black king can stay in , and this lemma reapplies.
-
–
-
-
(b)
If the rook is on :
-
If the king moves, this lemma reapplies as above.
-
Moving the rook
-
–
up lets Black move to the safe space .
-
–
down to leads to the Black king can stay on and this Lemma reapplies.
-
–
down to let Black move to the safe space.
-
–
to the left or right allows the Black king to move to the safe space.
-
–
-
-
(a)
-
2.
Let the White king be on .
-
(a)
If the rook is on :
-
Moving the king leads to either the king being captured, or the Black king can stay on and the lemma reapplies.
-
Moving the rook
-
–
down either results in capture of the rook or Black can move to the safe space .
-
–
up or right let Black move to (safe space) or reapply the lemma.
-
–
left either let Black move to the safe space () or the Black king can stay in and the lemma reapplies.
-
–
-
-
(b)
If the rook is on :
-
Moving the king either allows Black to capture it, or the Black king can stay on and this lemma can reapply.
-
Moving the rook
-
–
down either results in capture or allows Black to move to the safe space .
-
–
up or right allows the Black king to stay on and reapply this lemma.
-
–
to the left:
-
*
Moving it to allows Black to stay on and reapply this lemma.
-
*
Moving it to : Black chooses not to be there, extending the uncertainty to , , while maintaining its position on , , leading to Lemma (***).
-
*
Moving it to : Black chooses to be on , then moves to , , , , leading again to Lemma (***).
-
*
-
–
-
-
(a)
-
3.
Let the White king be on . The cases are similar to 2, except that Black moves to the safe space square instead of e.g. .
-
4.
Let the White king be on (dangerous (!) because the White king blocks the reachable squares of the safe space).
-
Moving the king either allows Black to capture it, or the Black king can stay on , and this lemma can reapply.
-
Moving the rook left, up, or right results in Lemma (***), the rook being captured, or the Black king can stay on and this lemma reapplies.
-
Moving the rook down to , then the Black king can stay on and this lemma reapplies.
-
Moving the rook down to allows Black to take the rook.
-
Moving the rook down to :
-
–
to : Black chooses to be on , and can then move to , or .
-
*
Move the White king
-
·
Left/ Left-down, then capture.
-
·
down: this situation is described as at the end of this proof.
-
·
anywhere else: Move to safe space ().
-
·
-
*
Move the rook
-
·
up: Then Black decides to be on , then expanding to , so this lemma reapplies.
-
·
left/ right: either Black can take the rook, or Black decides to be on , and expands to , (Situation , see below).
-
·
down, Black decides to be on and expands to (Situation , see below).
-
·
-
*
-
–
The squares , behave analogously.
-
–
Move the rook to . Then Black chooses not to be on . So, black can now be on , , , and E2 (!).
-
*
If White now moves the rook up (more than one square), then either Black takes or we can apply Lemma (***) as the king can now expand to and .
-
*
If White moves the rook up one square, then the previous case with the rook on can be applied as Black might be on . So, the Black king can stay on and this lemma reapplies.
-
*
If White moves anything anywhere else, then Black can move to the safe space, as he can be on or capture.
-
*
-
–
Analogously for , .
-
–
-
-
5.
If the king is on
-
Move the king: capture or Black can stay on and reapply this lemma.
-
Move the rook:
-
–
down to : move to safe space.
-
–
left to : take the rook.
-
–
left to : move to safe space.
-
–
otherwise the Black king can stay on and reapply this lemma.
-
–
-
(X1).
Then Black can move to any of and . Now, White is to move.
-
If the White king moves, then either capture it or Lemma (***) (, , , which by rotating the board results in Lemma (***)).
-
If the rook moves:
-
–
down; then Lemma (***) by moving to .
-
–
left; then take or Lemma (***).
-
–
right; then ends up in Lemma (***).
-
–
up to (one or two squares): then Black decides to be on , and expands to and , resulting in Lemma (***). Otherwise, results in this Lemma (**) by moving to , rotate board.
-
–
(X2).
It is White’s turn.
-
Moving the king, either take, or Lemma (***).
-
Move the rook:
-
–
down, left, right, then take or Lemma (***).
-
–
up three squares to (otherwise Lemma (***)): expand to which leads to Lemma (***).
-
–
(X3).
It is White’s turn.
-
Move king: either Black captures or Lemma (***) (could also move to safe-square).
-
Move rook: Up four squares, then this lemma reoccurs by expanding to , , otherwise: capture or Lemma (***)
Finally we can use those observations to provide a strategy for Black:
Lemma 17.
Let it be White’s turn. Let Black be on a square which is not covered by White. And let Black start on any of the squares .
Then Black cannot be forced onto an edge in a way that allows White to win.
Proof.
We will show that if the White player starts (and cannot immediately take the Black king), then the Black king can always remain either inside the safe space or on squares from which his moves cannot be reduced to one edge (undesired square). Black always tries to prevent this by going to a square inside the safe-zone whenever there exist uncovered ones.
We distinguish between a corner case and an edge-but-not-corner case. The corner squares of the safe space are , , , and . The edge-but-not-corner squares are all other squares on the edge of the safe space.
Case 1: The Black king is not in a corner of the safe space.
If he is somewhere on , then White cannot force him out of the safe space in the next move, and he cannot be captured if he is not on the edge.
Thus, the Black king is at the edge of the safe space, but not in a corner. To be forced down from here, the board must look like Figure 13.
Black can only be forced out of the safe space, if the rook attacks the rank or file of the Black king, and the White king covers the remaining squares inside the safe space.
Let the White king be on , the rook on , and the Black king on (as on Figure 13). If the Black king is forced down, he can always move to , or , regardless. White cannot know where the Black king moved; therefore, he might be on any of those squares.
-
Then White can move the king, afterwards Black can move from to , , or and from to , which allows the application of Lemma (***)
-
If White moves the rook up or down: Black returns to the safe space. If the rook is moved left or right, either the rook is captured or the Black king can move as in the case the king moved, therefore we can apply Lemma (***).
Case 2: Black is forced outside the safe space from a corner of the safe space.
Without loss of generality, let this corner be . To force the Black king outside the safe space, White has to cover all squares adjacent to the Black king in the safe space:
We note that the White king must always cover at least one square in the safe space adjacent to the Black king. Otherwise, the rook must be on to cover all. Then either the king must be adjacent (but then he would cover ), or Black can take the rook.
We now consider all combinations of the White king’s and rook’s positions that cover all safe spaces adjacent to the Black king. We then analyze the situation after White’s next move.
-
1.
Place the White king on . Then is covered. The rook then has to cover the -file.
-
(a)
If the rook is placed on , , or , the Black king would capture it.
-
(b)
If the rook is placed on , then Black moves to ; the rook then must retreat. After that, Black can return to (if the rook moved to , Black would capture it).
-
(c)
If the rook is placed on , the Black king could move to any square among , , or , which introduces uncertainty for White. White is to move.
-
i.
Let White move the king. If the king moves downward, Black can capture, as he might be on . If the White king moves elsewhere, the Black king returns to .
-
ii.
Let White move the rook. If the rook moves up, to the right, or down one square, Black can return to . If the rook is moved further down, Black, being on , captures. If the rook is moved left, then Black, being on , moves to .
-
i.
-
(a)
-
2.
White king on . Then and are covered. The rook only needs to cover .
-
(a)
Rook on : White moving anything anywhere leads to Black moving back to the safe space or capturing material of White.
-
(b)
Rook on or : then the Black king captures it.
-
(c)
Rook on : then Black moves down to . The White rook must move; he can only block the safe space by going to , where the Black king captures it.
-
(d)
Rook on . Black moves to one of , , .
-
i.
If White moves the rook, Black can either capture it or move back to .
-
ii.
If the king moves down-right, the Black king could move to any of , . This case is discussed in Lemma 15.
-
iii.
If White moves the king anywhere else, then Black can return to .
-
i.
-
(e)
Rook on : Then moving the Black king would threaten the rook, forcing it to move; after this, Black can either capture the rook or return to .
-
(f)
Rook on , or : in each case, the Black king captures it.
-
(g)
Rook on : Black moves to either , , or . White is to move.
-
Moving the rook up or down allows the Black king to return to .
-
Moving the king lets the Black king expand to , , , , or , while also possibly being on , . This case is discussed in Lemma 16.
-
Moving the rook to the left or right either results in the rook being captured or restricting the Black king, as in the last case. This case is discussed in Lemma 16.
-
-
(a)
-
3.
Place the White king on . This case is analogous to (Case 2.).
-
4.
Place the White king on . Then the rook must be on . In this case, the Black king moves to either , , or .
Figure 14: Black moves to one of , , or . -
If the rook moves down or left, it is captured.
-
Otherwise, the Black can return to (safe space).
-
Hence, either the Black king cannot be forced to one edge or White cannot win.
Corollary 18.
If White starts with a king and a rook, and Black only has a king. The Black king is not in check and anywhere on , and it is White’s turn. Then White cannot force a win.
4 Two Rooks and King vs. King
Finally, we consider the endgame of a king and two rooks against a king. As before, let White have a king and two rooks, and Black only a king. White starts and knows the starting position of Black. We prove that for any starting position of the Black and White figures, there exists a winning strategy for White. Also in classical chess, this is a win for White [4].
The strategy consists of three stages, organized in three lemmas below. In the first stage, we will prove that White can move the two rooks on one rank/file while ensuring that the own king is not on it as well. Secondly, we will show that we can move the White king into one corner and the two rooks are adjacent to him. And lastly, we will prove that the two rooks and the king can force a checkmate from the edge position.
Let us start with the first stage: we move the two rooks such that they cover each other, and their own king is not on either the same rank or file.
Lemma 19.
Given that White starts with a king and two rooks, and Black only a king. It is White’s turn. White knows the starting position of the Black king.
Then within at most two moves, White can move the rooks such that they cover each other without their own king being on either the same rank or file as both of the rooks.
Proof.
Note that when Black starts on , there is at most a -square in which Whites figures are at risk in Blacks second move.
Therefore, there are at least two ranks/files available which are safe from the opponent’s king after its first move and without the own White king. Note that the Black king cannot block any move of the rooks, as if he could, the rooks would be able to capture him.
In the first two moves, White can move the two rooks to one of the ranks/files. Now we will see that the two rooks can assist their own king to move to a corner.
Lemma 20.
Given a situation after Lemma 19. Then White can move its own king in a corner and the two rooks to adjacent squares.
Proof.
Note that rooks can move freely on the rank/file where the White king is not. This can be done, as the rooks cover each other, and their own king cannot block them.
White moves their own king towards an edge by repeating the following strategy:
-
Cover two files/ranks ahead of the own king, such that he can move freely there. If there is only one file/rank ahead, cover that one.
-
Move the own king one square towards one edge (not diagonal).
The second step can be done, as the rooks cover all squares which are adjacent to the new position of the own king (which are not covered by the king itself). One might note that diagonal moves are not always safe, and that it is possible for the Black king to hide behind the White king such that he does not get seen by the rooks.
Thus, when the White king arrives at the edge, he cannot move away from the rooks without the risk of running into Black’s king. Instead, he has to move towards his own rooks.
When the White king arrives at the field adjacent to the corner (which is blocked by a rook), it is easy to see that White can safely rotate its own pieces to free the corner from the rook and move the king here and the rooks adjacent to him. Finally, we see that the king and two rooks can finish by forcing a checkmate.
Lemma 21.
Assume White starts with a king and two rooks, and Black only a king. It is White’s turn. Suppose the White king is in one corner, and the two rooks are adjacent to him.
Then there is a strategy such that White always wins.
Proof.
Without loss of generality, let the White king be on , and the two rooks on (Rook 1) and (Rook 2). The following strategy resembles the staircase mate in classical chess, but we have to be more careful, as we do not know the exact position of the Black king. Therefore, we have to cover the rooks with the White king such that the Black king cannot take one of them. The strategy proceeds as follows and can be repeated until checkmate:
-
Move Rook 2 up one square.
-
Move Rook 1 up one square.
-
Move the White king one square up.
As in classical chess, this forces the Black king to move up (and right), as otherwise White would capture him. Eventually, the Black king has no moves left to escape.
Corollary 22.
Given that White starts with a king and two rooks, and Black with a king. White begins and knows the initial position of the Black king. Then White wins.
5 Final Comments and Open Questions
We showed that in Fog of War chess, given that one player has a king and queen and plays against a lone king, he can always guarantee a win. In contrast to classical chess, if one player has a king and a rook, then he cannot guarantee a win against a player with a lone king. However, adding one more rook for the player with the rook guarantees a win for him.
In Fog of War chess, there exist many more open questions concerning endgames:
First and foremost, endgames using knights, bishops, or a combination of several pieces are yet to be answered. As in classical chess, endgames can also occur where the opponent has not just the king, but also a few more own pieces available.
Another relevant question is to minimize the number of moves one player needs to make to ensure a win. We suspect that our strategy for king and queen versus king cannot be performed within 50 moves, which might be relevant when one plays with a fifty-move rule. Potentially, another strategy could guarantee a win faster and within 50 moves. Our strategy for king and two rooks versus king however, should work within 50 moves.
We also ignore the draw rule for move repetition. While our studied strategies do not require repeating moves, there might be other endgames in Fog of War chess where this aspect becomes crucial (as, e.g., the algorithm might need to repeat its moves for restricting the space for opponents pieces).
Finally, it is worth mentioning that also other variants with limited knowledge about the board than the classical Fog of War variant might yield interesting results.
In conclusion, Fog of War chess presents a rich field for theoretical exploration, with many open questions and potential for further research.
We hope that our work contributes to the understanding of endgames in Fog of War chess and opens up avenues for future research in this intriguing variant of chess.
References
- [1] Chess.com. Chessboard - chess terms. https://www.chess.com/terms/chessboard. Accessed: 2026-01-06.
- [2] Chess.com. Fog of war chess - leaderboards. https://www.chess.com/variants/fog-of-war/leaderboards. Accessed: 2026-01-06.
- [3] Michael J. Coulombe and Jayson Lynch. Cooperating in Video Games? Impossible! Undecidability of Team Multiplayer Games. In FUN 2018, 2018.
- [4] Reuben Fine and Pal Benko. Basic Chess Endings. McKay, 2003.
- [5] Matthias Gehnen and Luca Venier. Tetris Is Not Competitive. In FUN 2024, 2024.
- [6] GothamChess. Hikaru vs. gotham: Fog of war chess variant. https://www.youtube.com/watch?v=1P35o2pAGws, 2020. Accessed: 2026-01-06.
- [7] MIT Hardness Group, Della Hendrickson, and Andy Tockman. Complexity of Planar Graph Orientation Consistency, Promise-Inference, and Uniqueness, with Applications to Minesweeper Variants. In FUN 2024, 2024.
- [8] Hikaru Nakamura. The best way to win at fog of war chess. https://www.youtube.com/watch?v=Nu7zeKQZ-s4, 2021. Accessed: 2026-01-06.
- [9] Jens Bæk Nielsen. Darkness chess. https://www.chessvariants.com/incinf.dir/darkness.html, 1997. Accessed: 2026-01-06.
- [10] Brian Hu Zhang and Tuomas Sandholm. General search techniques without common knowledge for imperfect-information games, and application to superhuman fog of war chess. arXiv preprint arXiv:2506.01242, 2025. doi:10.48550/arXiv.2506.01242.
