Abstract strategy game



An abstract strategy game is a strategy game that minimizes luck and does not rely on a theme. Almost all abstract strategy games will conform to the strictest definition of: a gameboard, card, or tile game in which there is no hidden information, no non-deterministic elements (such as shuffled cards or dice rolls), and (usually) two players or teams taking a finite number of alternating turns.

Many of the world's classic board games, including chess, Nine Men's Morris, checkers and draughts, Go, xiangqi, shogi, Reversi, and most mancala variants, fit into this category. Play is sometimes said to resemble a series of puzzles the players pose to each other. As J. Mark Thompson wrote in his article "Defining the Abstract": "There is an intimate relationship between such games and puzzles: every board position presents the player with the puzzle, What is the best move?, which in theory could be solved by logic alone. A good abstract game can therefore be thought of as a 'family' of potentially interesting logic puzzles, and the play consists of each player posing such a puzzle to the other. Good players are the ones who find the most difficult puzzles to present to their opponents."

Definition
The most strict definition of an abstract strategy game requires that it cannot have random elements or hidden information. In practice, however, many games that do not strictly meet these criteria are commonly classified as abstract strategy games. (Games such as Continuo, Octiles, Can't Stop, Sequence, and Mentalis could be considered abstract strategy games, despite having a luck or bluffing element.) A smaller category of non-perfect abstract strategy games manages to incorporate hidden information without using any random elements. (The best known example is Stratego.)

Traditional abstract strategy games are often treated as a separate category of game, hence the term 'abstract games' is often used for competitions that exclude traditional games, and can be thought of as referring to modern abstract strategy games. (Two examples of this were the IAGO World Tour [2007–10] and the Abstract Games World Championship held annually since 2008 as part of the Mind Sports Olympiad. )

Some abstract strategy games have multiple starting positions of which it is required that one be randomly determined. At the very least, in all conventional abstract strategy games, a starting position needs to be chosen by some means extrinsic to the game. Some games, such as Arimaa and DVONN, have the players build the starting position in a separate initial phase which itself conforms strictly to abstract strategy game principles. Most players, however, would consider that although one is then starting each game from a different position, the game itself contains no luck element. Indeed, Bobby Fischer promoted the randomization of the starting position of a game of chess in order to increase the game's dependence on thinking at the board.

Comparison
Analysis of “pure” abstract strategy games is the subject of combinatorial game theory. Abstract strategy games with hidden information, bluffing, or simultaneous move elements are better served by Von Neumann-Morgenstern game theory, while those with a component of luck may require probability theory incorporated into either of the above.

As for the qualitative aspects, ranking abstract strategy games according to their interest, complexity, or strategy levels is a daunting task and subject to extreme subjectivity. In terms of measuring how finite a mathematical field each of the three top contenders represents, it is estimated that checkers has a game-tree complexity of 1031 possible positions, whereas chess has approximately 10123. This suggests that computer programs, through brute force calculation alone, should often be able to surpass human players' abilities. As for Go, the possible legal game positions range in the magnitude of 10361. Computers have yet to come close to defeating a ranked professional Go player.

Champions
The Mind Sports Olympiad first held the Abstract Games World Championship in 2008 to try to find the best abstract strategy games all-rounder. The MSO event saw a change in format in 2011 restricting the competition to players' five best events, and was renamed to the Modern Abstract Games World Championship. It was again won by David Pearce.


 * 2008: 🏴󠁧󠁢󠁥󠁮󠁧󠁿 David M. Pearce (England)
 * 2009: 🏴󠁧󠁢󠁥󠁮󠁧󠁿 David M. Pearce (England)
 * 2010: 🏴󠁧󠁢󠁥󠁮󠁧󠁿 David M. Pearce (England)
 * 2011: 🏴󠁧󠁢󠁥󠁮󠁧󠁿 David M. Pearce (England)
 * 2012: 🇪🇪 Andres Kuusk (Estonia)
 * 2013: 🇪🇪 Andres Kuusk (Estonia)