Domineering
Domineering (also called Stop-Gate or Crosscram) 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. (Traditionally, these players are called "Left" and "Right", respectively, or "V" and "H". Both conventions are used in this article.) As in most games in combinatorial game theory, the first player who cannot move loses. Domineering is a partisan game, in that players use different pieces: the impartial version of the game is Cram. Basic examples Single box Other than the empty game, where there is no grid, the simplest game is a single box. In this game, clearly, neither player can move. Since it is a second-pl ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Combinatorial Game Theory
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. C ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Combinatorial Game Theory
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. C ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Cram (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 each player 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''. Rules The game is played on a sheet of graph paper, with any set of designs traced out. It is most commonly played on rectangular board like a 6×6 square or a checkerboard, but it can also be played on an entirely irregular polygon or a cylindrical board. Two players have a collection of dominoes which they place on the grid in turn. A player can place a domino either horizontally or vertically. Contrary to the related game of Domineering, the possible moves are the same for the two players, and Cram is then an impartial game. As for all impartial games, there are tw ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Impartial Game
In combinatorial game theory, an impartial game is a game in which the allowable moves depend only on the position and not on which of the two players is currently moving, and where the payoffs are symmetric. In other words, the only difference between player 1 and player 2 is that player 1 goes first. The game is played until a terminal position is reached. A terminal position is one from which no moves are possible. Then one of the players is declared the winner and the other the loser. Furthermore, impartial games are played with perfect information and no chance moves, meaning all information about the game and operations for both players are visible to both players. Impartial games include Nim, Sprouts, Kayles, Quarto, Cram, Chomp, Subtract a square, Notakto, and poset games. Go and chess are not impartial, as each player can only place or move pieces of their own color. Games such as poker, dice or dominos are not impartial games as they rely on chance. Impartial games c ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Tile-based Game
A tile-based game is a game that uses tiles as one of the fundamental elements of play. Traditional tile-based games use small tiles as playing pieces for gambling or entertainment games. Some board games use tiles to create their board, giving multiple possibilities for board layout, or allowing changes in the board geometry during play. Each tile has a back (undifferentiated) side and a face side. Domino tiles are usually rectangular, twice as long as they are wide and at least twice as wide as they are thick, though games exist with square tiles, triangular tiles and even hexagonal tiles. Traditional games * Anagrams * Chinese dominoes * Dominoes * Mahjong Commercial games * ''Okey'' * ''Quad-Ominos'' * ''Qwirkle'' * ''Rummikub'' * ''Scrabble'' Games using non-rectangular tiles * ''Bendomino'' * ''Blokus'' * ''Gheos'' * '' Heroscape'' * ''Hive'' * ''Tantrix'' * ''Triominos'' Board games * '' Alhambra'' * ''Azul (board game)'' * ''Betrayal at House on the Hill'' * ''Car ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Cold Game
__NOTOC__ In combinatorial game theory, a branch of mathematics, a hot game is one in which each player can improve their position by making the next move. By contrast, a cold game is one where each player can only worsen their position by making the next move. Cold games have values in the surreal numbers and so can be ordered by value, while hot games can have other values. Example For example, consider a game in which players alternately remove tokens of their own color from a table, the Blue player removing only blue tokens and the Red player removing only red tokens, with the winner being the last player to remove a token. Obviously, victory will go to the player who starts off with more tokens, or to the second player if the number of red and blue tokens are equal. Removing a token of one's own color leaves the position slightly worse for the player who made the move, since that player now has fewer tokens on the table. Thus each token represents a "cold" component o ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Hot Game
__NOTOC__ In combinatorial game theory, a branch of mathematics, a hot game is one in which each player can improve their position by making the next move. By contrast, a cold game is one where each player can only worsen their position by making the next move. Cold games have values in the surreal numbers and so can be ordered by value, while hot games can have other values. Example For example, consider a game in which players alternately remove tokens of their own color from a table, the Blue player removing only blue tokens and the Red player removing only red tokens, with the winner being the last player to remove a token. Obviously, victory will go to the player who starts off with more tokens, or to the second player if the number of red and blue tokens are equal. Removing a token of one's own color leaves the position slightly worse for the player who made the move, since that player now has fewer tokens on the table. Thus each token represents a "cold" component o ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Blockbusting (game)
Blockbusting is a solved combinatorial game introduced in 1987 by Elwyn Berlekamp illustrating a generalisation of overheating. The analysis of Blockbusting may be used as the basis of a strategy for the combinatorial game of Domineering. Blockbusting is a partisan game for two players known as Red and Blue (or Right and Left) played on an n \times 1 strip of squares called "parcels". Each player, in turn, claims and colors one previously unclaimed parcel until all parcels have been claimed. At the end, Left's score is the number of pairs of neighboring parcels both of which he has claimed. Left therefore tries to maximize that number while Right tries to minimize it. Adjacent Right-Right pairs do not affect the score. Although the purpose of the game is to further the study of combinatorial game theory, Berlekamp provides an interpretation alluding to the practice of blockbusting by real estate agents: the players may be seen as rival agents buying up all the parcels on a ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Mathematical Games
A mathematical game is a game whose rules, strategies, and outcomes are defined by clear mathematical parameters. 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. 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. Some mathematical games are of deep interest in the field of recreational mathematics. When studying a game's core mathematics, arithmetic theory i ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Mathematical Game
A mathematical game is a game whose rules, strategies, and outcomes are defined by clear mathematical parameters. 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. 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. Some mathematical games are of deep interest in the field of recreational mathematics. When studying a game's core mathematics, arithmetic theory i ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Sprague–Grundy Theorem
In combinatorial game theory, the Sprague–Grundy theorem states that every impartial game under the normal play convention is equivalent to a one-heap game of nim, or to an infinite generalization of nim. It can therefore be represented as a natural number, the size of the heap in its equivalent game of nim, as an ordinal number in the infinite generalization, or alternatively as a nimber, the value of that one-heap game in an algebraic system whose addition operation combines multiple heaps to form a single equivalent heap in nim. The Grundy value or nim-value of any impartial game is the unique nimber that the game is equivalent to. In the case of a game whose positions are indexed by the natural numbers (like nim itself, which is indexed by its heap sizes), the sequence of nimbers for successive positions of the game is called the nim-sequence of the game. The Sprague–Grundy theorem and its proof encapsulate the main results of a theory discovered independently by R ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Abstract Strategy Games
Abstract strategy games admit a number of definitions which distinguish these from strategy games in general, mostly involving no or minimal narrative theme, outcomes determined only by player choice (with no randomness), and perfect information. 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. Definition Combinatorial games have no randomizers such as dice, no simultaneous movement, nor hidden information. Some games that do have these elements are sometimes classified as abstract strategy games. (Games such as '' Continuo'', Octiles, '' Can't Stop'', and Sequence, could be considered abstract strategy games, despite having a luck or bluffing element.) A smaller category of abstract strategy games manages to ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |