Mathematical game

Last updated
The wagon must travel a path that is given by a mathematical function.

A mathematical game is a game whose rules, strategies, and outcomes are defined by clear mathematical parameters. [1] [ verification needed ] Often, such games have simple rules and match procedures, such as tic-tac-toe and dots and boxes. Generally, mathematical games need not be conceptually intricate to involve deeper computational underpinnings. For example, even though the rules of Mancala are relatively basic, the game can be rigorously analyzed through the lens of combinatorial game theory.[ citation needed ]

Contents

Mathematical games differ sharply from mathematical puzzles in that mathematical puzzles require specific mathematical expertise to complete, whereas mathematical games do not require a deep knowledge of mathematics to play. Often, the arithmetic core of mathematical games is not readily apparent to players untrained to note the statistical or mathematical aspects.[ citation needed ]

Some mathematical games are of deep interest in the field of recreational mathematics. [2] [ verification needed ]

When studying a game's core mathematics, arithmetic theory is generally of higher utility than actively playing or observing the game itself. To analyze a game numerically, it is particularly useful to study the rules of the game insofar as they can yield equations or relevant formulas. This is frequently done to determine winning strategies or to distinguish if the game has a solution.[ citation needed ]

Additionally, mathematical games can aid children in grasping fundamental concepts such as addition, subtraction, multiplication, [3] and division, enhancing their arithmetic skills in an engaging manner.

List of games

Sometimes it is not immediately obvious that a particular game involves chance. Often a card game is described as "pure strategy" and such, but a game with any sort of random shuffling or face-down dealing of cards should not be considered to be "no chance". Several abstract strategy games are listed below:

Lattice board

Non-lattice boards and other games

Chance involved or imperfect information

See also

Related Research Articles

<span class="mw-page-title-main">Board game</span> Genre of seated tabletop social play

Board games are tabletop games that typically use pieces. These pieces are moved or placed on a pre-marked board and often include elements of table, card, role-playing, and miniatures games as well.

Recreational mathematics is mathematics carried out for recreation (entertainment) rather than as a strictly research- and application-based professional activity or as a part of a student's formal education. Although it is not necessarily limited to being an endeavor for amateurs, many topics in this field require no knowledge of advanced mathematics. Recreational mathematics involves mathematical puzzles and games, often appealing to children and untrained adults and inspiring their further study of the subject.

<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.

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.

In the context of combinatorial game theory, which typically studies sequential games with perfect information, a game tree is a graph representing all possible game states within such a game. Such games include well-known ones such as chess, checkers, Go, and tic-tac-toe. This can be used to measure the complexity of a game, as it represents all the possible ways a game can pan out. Due to the large game trees of complex games such as chess, algorithms that are designed to play this class of games will use partial game trees, which makes computation feasible on modern computers. Various methods exist to solve game trees. If a complete game tree can be generated, a deterministic algorithm, such as backward induction or retrograde analysis can be used. Randomized algorithms and minmax algorithms such as MCTS can be used in cases where a complete game tree is not feasible.

<span class="mw-page-title-main">Combinatorial game theory</span> Branch of game theory about two-player sequential games with perfect information

Combinatorial game theory is a branch of mathematics and theoretical computer science that typically studies sequential games with perfect information. Study has been largely confined to two-player games that have a position that the players take turns changing in defined ways or moves to achieve a defined winning condition. Combinatorial game theory has not traditionally studied games of chance or those that use imperfect or incomplete information, favoring games that offer perfect information in which the state of the game and the set of available moves is always known by both players. However, as mathematical techniques advance, the types of game that can be mathematically analyzed expands, thus the boundaries of the field are ever changing. Scholars will generally define what they mean by a "game" at the beginning of a paper, and these definitions often vary as they are specific to the game being analyzed and are not meant to represent the entire scope of the field.

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.
<span class="mw-page-title-main">3D tic-tac-toe</span> 1978 video 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.

<span class="mw-page-title-main">Abstract strategy game</span> Mental skill based games

An abstract strategy game is a type of strategy game that has minimal or no narrative theme, an outcome determined only by player choice, and in which each player has perfect information about the game. For example, Go is a pure abstract strategy game since it fulfills all three criteria; chess and related games are nearly so but feature a recognizable theme of ancient warfare; and Stratego is borderline since it is deterministic, loosely based on 19th-century Napoleonic warfare, and features concealed information.

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">Teeko</span> Board game

Teeko is an abstract strategy game invented by John Scarne in 1937 and rereleased in refined form in 1952 and again in the 1960s. Teeko was marketed by Scarne's company, John Scarne Games Inc.; its quirky name, he said, borrowed letters from Tic-tac-toe, Chess, Checkers, and Bingo.

Harary's generalized tic-tac-toe or animal tic-tac-toe is a generalization of the game tic-tac-toe, defining the game as a race to complete a particular polyomino on a square grid of varying size, rather than being limited to "in a row" constructions. It was devised by Frank Harary in March 1977, and is a broader definition than that of an m,n,k-game.

<span class="mw-page-title-main">Game</span> Structured form of play

A game is a structured form of play, usually undertaken for entertainment or fun, and sometimes used as an educational tool. Many games are also considered to be work or art.

<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">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.

A positional game is a kind of a combinatorial game for two players. It is described by:

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

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.

A nd game (or nk game) is a generalization of the combinatorial game tic-tac-toe to higher dimensions. It is a game played on a nd hypercube with 2 players. If one player creates a line of length n of their symbol (X or O) they win the game. However, if all nd spaces are filled then the game is a draw. Tic-tac-toe is the game where n equals 3 and d equals 2 (3, 2). Qubic is the (4, 3) game. The (n > 0, 0) or (1, 1) games are trivially won by the first player as there is only one space (n0 = 1 and 11 = 1). A game with d = 1 and n > 1 cannot be won if both players are playing well as an opponent's piece will block the one-dimensional line.

<i>Gobs of Games</i> 2000 video game

Gobs of Games, released in Europe as Games Frenzy, is a 2000 video game for the Game Boy Color developed by 2N Productions and published by The 3DO Company, who showcased the game at E3 2000. The game is a compilation of compilation of puzzle games, including simplified iterations of traditional games, including peg solitaire, checkers and tic tac toe.

References

  1. "Games, theory of - Encyclopedia of Mathematics". encyclopediaofmath.org. Retrieved 2021-08-11.
  2. Sumpter, Lovisa (January 2015). "Recreational Mathematics – Only For Fun?". Journal of Humanistic Mathematics. 5 (1): 121–138. doi: 10.5642/jhummath.201501.07 . S2CID   16590762 . Retrieved 11 August 2021.
  3. "Easy Multiplication". Play123.