Breakthrough is an abstract strategy board game invented by Dan Troyka in 2000 and made available as a Zillions of Games file (ZRF). It won the 2001 8x8 Game Design Competition, even though the game was originally played on a 7x7 board, as it is trivially extensible to larger board sizes.
The board is initially set up as shown on the first diagram. To play the game on a different-sized board, just fill the two front and two back rows with pieces; the board need not be square.[1]
Choose a player to go first; then play alternates, with each player moving one piece per turn.
A piece may move one space straight or diagonally forward if the target square is empty. In the second diagram, the white piece on c5 can move into any of the marked squares.
A piece may move into a square containing an opponent's piece if and only if that square is one step diagonally forward. The opponent's piece is removed and the player's piece replaces it. For example, the black piece can capture either the white piece e2 or the one on g2; it would replace them if it chose to capture. Note that capturing is not compulsory, nor is it "chained" as in checkers; a player can only capture one piece in a turn.
The first player to reach the opponent's home row — the one farthest from the player — is the winner.[1] If all the pieces of a player are captured, that player loses. A draw is impossible[2] because pieces can only move ahead (or be captured), and the piece closest to the opponent's home row always has at least one forward diagonal move available.
Although the rules are quite simple (and were the simplest rules in the 2001 8x8 Game Design Competition), the strategy is complex and sophisticated. Generally, an effective offensive strategy is to recognize and attack "pivotal" pieces which are in positions to block multiple routes to victory. An effective defense is to arrange multiple blocking pieces in a blocking pattern (since a single defending piece can not effectively block a single attacking piece).
Smaller variants of the game have been solved:[3]