M,n,k-game

Last updated

Example of a completed 11,10,5-game Tic-tac-toe 5.png
Example of a completed 11,10,5-game

An m,n,k-game is an abstract board game in which two players take turns in placing a stone of their color on an m-by-n board, the winner being the player who first gets k stones of their own color in a row, horizontally, vertically, or diagonally. [1] [2] Thus, tic-tac-toe is the 3,3,3-game and free-style gomoku is the 15,15,5-game. An m,n,k-game is also called a k-in-a-row game on an m-by-n board.

Contents

The m,n,k-games are mainly of mathematical interest. One seeks to find the game-theoretic value, the result of the game with perfect play. This is known as solving the game.

Strategy stealing argument

A standard strategy stealing argument from combinatorial game theory shows that in no m,n,k-game can there be a strategy that assures that the second player will win (a second-player winning strategy). This is because an extra stone given to either player in any position can only improve that player's chances. The strategy stealing argument assumes that the second player has a winning strategy and demonstrates a winning strategy for the first player. The first player makes an arbitrary move, to begin with. After that, the player pretends that they are the second player and adopts the second player's winning strategy. They can do this as long as the strategy doesn't call for placing a stone on the 'arbitrary' square that is already occupied. If this happens, though, they can again play an arbitrary move and continue as before with the second player's winning strategy. Since an extra stone cannot hurt them, this is a winning strategy for the first player. The contradiction implies that the original assumption is false, and the second player cannot have a winning strategy.

This argument tells nothing about whether a particular game is a draw or a win for the first player. Also, it does not actually give a strategy for the first player.

Applying results to different board sizes

A useful notion is a "weak (m,n,k) game", where k-in-a-row by the second player does not end the game with a second player win.

If weak (m,n,k) is a draw, then decreasing m or n, or increasing k will also result in a drawn game.

Conversely, if weak or normal (m,n,k) is a win, then any larger weak (m,n,k) is a win.

Note that proofs of draws using pairing strategies also prove a draw for the weak version and thus for all smaller versions.

General results

The following statements refer to the first player in the weak game, assuming that both players use an optimal strategy.

Specific results

Multidimensional variant

It is possible to consider variants played on a multidimensional board instead of a bidimensional board.

For the case of k-in-a-row where the board is an n-dimensional hypercube with all edges with length k, Hales and Jewett proved [5] that the game is a draw if k is odd and

k ≥ 3n − 1

or if k is even and

k ≥ 2n+1 − 2.

They conjecture that the game is a draw also when the number of cells is at least twice the number of lines, which happens if and only if

2 kn ≥ (k + 2)n.

See also

Related Research Articles

<i>Gomoku</i> Abstract strategy board game

Gomoku, also called Five in a Row, is an abstract strategy board game. It is traditionally played with Go pieces on a 15×15 Go board while in the past a 19×19 board was standard. Because pieces are typically not moved or removed from the board, gomoku may also be played as a paper-and-pencil game. The game is known in several countries under different names.

<span class="mw-page-title-main">Pente</span> Abstract strategy board game

Pente is an abstract strategy board game for two or more players, created in 1977 by Gary Gabrel. A member of the m,n,k game family, Pente stands out for its custodial capture mechanic, which allows players to "sandwich" pairs of stones and capture them by flanking them on either side. This changes the overall tactical assessments players face when compared to pure placement m,n,k games such as Gomoku.

<span class="mw-page-title-main">Tic-tac-toe</span> Paper-and-pencil game for two players

Tic-tac-toe, noughts and crosses, or Xs and Os is a paper-and-pencil game for two players who take turns marking the spaces in a three-by-three grid with X or O. The player who succeeds in placing three of their marks in a horizontal, vertical, or diagonal row is the winner. It is a solved game, with a forced draw assuming best play from both players.

<span class="mw-page-title-main">Hex (board game)</span> Abstract strategy board game

Hex is a two player abstract strategy board game in which players attempt to connect opposite sides of a rhombus-shaped board made of hexagonal cells. Hex was invented by mathematician and poet Piet Hein in 1942 and later rediscovered and popularized by John Nash.

<span class="mw-page-title-main">Fanorona</span> Board game from Madagascar

Fanorona is a strategy board game for two players. The game is indigenous to Madagascar.

A solved game is a game whose outcome can be correctly predicted from any position, assuming that both players play perfectly. This concept is usually applied to abstract strategy games, and especially to games with full information and no element of chance; solving such a game may use combinatorial game theory and/or computer assistance.

<span class="mw-page-title-main">Connect Four</span> Childrens board game

Connect Four is a game in which the players choose a color and then take turns dropping colored tokens into a six-row, seven-column vertically suspended grid. The pieces fall straight down, occupying the lowest available space within the column. The objective of the game is to be the first to form a horizontal, vertical, or diagonal line of four of one's own tokens. It is therefore a type of m,n,k-game with restricted piece placement. Connect Four is a solved game. The first player can always win by playing the right moves.

Combinatorial game theory measures game complexity in several ways:

  1. State-space complexity,
  2. Game tree size,
  3. Decision complexity,
  4. Game-tree complexity,
  5. Computational complexity.
<i>Renju</i> Traditional board game

Renju is a professional variant of gomoku. It was named renju by Japanese journalist Ruikou Kuroiwa (黒岩涙香) on December 6, 1899, in a Japanese newspaper Yorozu chouhou (萬朝報). The name "renju" means "connected pearls" in Japanese. The game is played with black and white stones on a 15×15 gridded go board.

<span class="mw-page-title-main">3D tic-tac-toe</span> Abstract strategy game

3D tic-tac-toe, also known by the trade name Qubic, is an abstract strategy board game, generally for two players. It is similar in concept to traditional tic-tac-toe but is played in a cubical array of cells, usually 4×4×4. Players take turns placing their markers in blank cells in the array. The first player to achieve four of their own markers in a row wins. The winning row can be horizontal, vertical, or diagonal on a single board as in regular tic-tac-toe, or vertically in a column, or a diagonal line through four boards.

In combinatorial game theory, the strategy-stealing argument is a general argument that shows, for many two-player games, that the second player cannot have a guaranteed winning strategy. The strategy-stealing argument applies to any symmetric game in which an extra move can never be a disadvantage. A key property of a strategy-stealing argument is that it proves that the first player can win the game without actually constructing such a strategy. So, although it might prove the existence of a winning strategy, the proof gives no information about what that strategy is.

<span class="mw-page-title-main">Domineering</span> Mathematical game

Domineering is a mathematical game that can be played on any collection of squares on a sheet of graph paper. For example, it can be played on a 6×6 square, a rectangle, an entirely irregular polyomino, or a combination of any number of such components. Two players have a collection of dominoes which they place on the grid in turn, covering up squares. One player places tiles vertically, while the other places them horizontally. As in most games in combinatorial game theory, the first player who cannot move loses.

<span class="mw-page-title-main">Connect6</span> Abstract strategy board game

Connect6 introduced in 2003 by Professor I-Chen Wu at Department of Computer Science and Information Engineering, National Chiao Tung University in Taiwan, is a two-player strategy game similar to Gomoku.

<span class="mw-page-title-main">Zillions of Games</span> General game playing software

Zillions of Games is a commercial general game playing system developed by Jeff Mallett and Mark Lefler in 1998. The game rules are specified with S-expressions, Zillions rule language. It was designed to handle mostly abstract strategy board games or puzzles. After parsing the rules of the game, the system's artificial intelligence can automatically play one or more players. It treats puzzles as solitaire games and its AI can be used to solve them.

<span class="mw-page-title-main">Cram (game)</span> Mathematical game

Cram is a mathematical game played on a sheet of graph paper. It is the impartial version of Domineering and the only difference in the rules is that players may place their dominoes in either orientation, but it results in a very different game. It has been called by many names, including "plugg" by Geoffrey Mott-Smith, and "dots-and-pairs". Cram was popularized by Martin Gardner in Scientific American.

<span class="mw-page-title-main">First-player and second-player win</span>

In combinatorial game theory, a two-player deterministic perfect information turn-based game is a first-player-win if with perfect play the first player to move can always force a win. Similarly, a game is second-player-win if with perfect play the second player to move can always force a win. With perfect play, if neither side can force a win, the game is a draw.

Proof-number search is a game tree search algorithm invented by Victor Allis, with applications mostly in endgame solvers, but also for sub-goals during games.

Solving chess consists of finding an optimal strategy for the game of chess; that is, one by which one of the players can always force a victory, or either can force a draw. It is also related to more generally solving chess-like games such as Capablanca chess and infinite chess. In a weaker sense, solving chess may refer to proving which one of the three possible outcomes is the result of two perfect players, without necessarily revealing the optimal strategy itself.

Gomocup is a worldwide tournament of artificial intelligences (AI) playing Gomoku and Renju. The tournament has been played since 2000 and takes place every year. As of 2016, it is the most famous and largest Gomoku AI tournament in the world, with around 40 participants from about 10 countries.

<span class="mw-page-title-main">Tic-tac-toe variants</span>

Tic-tac-toe is an instance of an m,n,k-game, where two players alternate taking turns on an m×n board until one of them gets k in a row. Harary's generalized tic-tac-toe is an even broader generalization. The game can also be generalized as a nd game. The game can be generalised even further from the above variants by playing on an arbitrary hypergraph where rows are hyperedges and cells are vertices.

References

  1. J. W. H. M. Uiterwijk and H. J van der Herik, The advantage of the initiative, Information Sciences 122 (1) (2000) 43-58.
  2. 1 2 Jaap van den Herik, Jos W.H.M. Uiterwijk, Jack van Rijswijck (2002). "Games solved: Now and in the future". Artificial Intelligence.
  3. Uiterwijk, Jos W.H.M. (20 August 2019). "Solving Strong and Weak 4-in-a-Row" (PDF). 2019 IEEE Conference on Games (CoG). IEEE: 1–8. doi:10.1109/CIG.2019.8848010. ISBN   978-1-7281-1884-0.
  4. Hsu, Wei-Yuan; Ko, Chu-Ling; Hsueh, Chu-Hsuan; Wu, I-Chen (2018). "Solving 7,7,5-game and 8,8,5-game". ICGA Journal . 40 (3). Retrieved 6 November 2019.
  5. Elwyn R. Berlekamp, John Horton Conway, Richard K. Guy. "Winning ways for your mathematical plays, Volume 3", A K Peters (2003)