# Black Path Game

The Black Path Game (also known by various other names, such as Brick) is a two-player board game described and analysed in Winning Ways for your Mathematical Plays. It was invented by Larry Black in 1960.
It has also been reported that a game known as "Black" or "Black's Game" was invented in 1960 by William L. Black. This "William L. Black" (possibly known as "Larry") was at that time an undergraduate at the Massachusetts Institute of Technology, investigating Hex and Bridg-It, two games based on the challenge to create a connected "chain" of counters that link opposite sides of a game board. The creative outcome of Black's research was a new topological game that his friends (perhaps unimaginatively) called Black. The game was introduced to the public by Martin Gardner in his October 1963 "Mathematical Games column" in Scientific American.

## Rules

The Black Path Game is played on a board ruled into squares. One edge on the boundary of the board is designated to be the start of the path. After the first move, the players extend the path away from the starting edge by alternately filling the adjacent square at the end of the current path with one of three configurations shown below.
Any square that is not empty is filled with one of the following configurations that contains two paths linking two sides:
* T1 tile, with paths connecting adjacent sides (top and left, and bottom and right)
* T2 tile, with paths connecting adjacent sides (top and right, and bottom and left)
* T3 tile, with paths connecting opposite sides (top and bottom, and left and right)
These tiles are the three ways to join the sides of the square in pairs. The first two are the tiles of the Truchet tiling.
The path may return to a previously filled square and follow the yet-unused segment on that square. The player who first causes the path to run back into the edge of the board loses the game.

## Strategy

As outlined in the example games provided, the player who routes the path into a corner of the board will win the game, as the other player will have no choice but to run the path into the edge of the board.
For a rectangular board with an even number of squares, the first player has a winning strategy. This occurs when at least one side-length is even. Imagine the board covered with rectangular (2×1 unit-size) dominoes. If the first player always plays so the end of the path falls on the middle of one of the dominoes, that player will win. This strategy was discovered by Black's friend Elwyn R. Berlekamp, who subsequently described it in his book.
For a rectangular board with an odd total number of squares, i.e., when both sides of the board are odd, the second player can instead win by using a similar domino tiling strategy occupying every square except the one containing the first player's first move.

### Logic

The domino tiling strategy works by making the losing player end the path on the edge of a new domino; by continuing the path on the new domino, the winning player will eventually force the losing player to the edge or a corner.
The second player can win on a board with an even number of square cells; first consider the board completely covered with 2×1 dominoes except for the upper left and lower right corners. If Player 2 forces Player 1 to move in [B2], the second cell of the main diagonal, regardless of Player 1's move in [B2], the unused path in [B2] will connect two squares which can be regarded as the two squares of a "split domino" that Player 2 can use, and the remaining tiles (save the lower-right corner) can be covered in dominoes.
Refer to the three examples below, illustrating the "split domino" that results from the third move:
* [A1]-T3
* [A2]-T2
3: [B2]-T1, path to [B1] :
| | A | B | C | D | |
| 1 | | | | | 1 |
| 2 | | | S | | 2 |
| 3 | | S | | | 3 |
| 4 | | | | | 4 |
| | A | B | C | D | |
3: [B2]-T2, path to [B3] :
| | A | B | C | D | |
| 1 | | S | | | 1 |
| 2 | | | S | | 2 |
| 3 | | | | | 3 |
| 4 | | | | | 4 |
| | A | B | C | D | |
3: [B2]-T3, path to [C2] :
| | A | B | C | D | |
| 1 | | S | | | 1 |
| 2 | | | | | 2 |
| 3 | | S | | | 3 |
| 4 | | | | | 4 |
| | A | B | C | D | |

### Examples

Consider the example game shown at right on a 4×4 grid, where the moves have been:
* [A1]-T2
* [B1]-T2
* [B2]-T3
* [B3]-T2
* [C3]-T1
* [C2]-T2
* [A2]-T1
* [A3]-T2
According to the rules, the next move by Player 1 (odd-numbered turns) must be in space [B4] to continue the path. If Player 1 makes the move [B4]-T3 that will result in an instant loss, since this tile will link the path to the bottom edge. Playing [B4]-T1 will result in a win, as Player 2's following move is placed in the corner [A4] and Player 3 will lose regardless of the piece played. Playing [B4]-T2 results in an eventual loss for Player 1; comparison to the 4×4 domino-tiled blank board shows that Player 1 making the move [B4]-T1 puts the path into the middle of the domino, while [B4]-T2 puts the path onto the edge of the domino, and Player 2 can maneuver Player 1 into making the last move.
Gardner describes a second example game, where the moves have been:
* [A1]-T3
* [A2]-T2
* [B2]-T3
* [C2]-T1
* [C1]-T2
* [B1]-T1
* [B3]-T2
* [C3]-T1
* [D2]-T1
In this second example, Player 1 has maneuvered the path into the corner space [D1], which results in a win regardless of the move made by Player 2. After the third move (by Player 2) in [B2]-T3, the split domino exists in cells [B1] and [B3]. However, the fifth move by Player 2 [C1]-T2 brought the path to the edge of the split domino, which Player 1 took advantage of with the sixth move [B1]-T1, playing to the middle of the split domino.