Positional game

Not to be confused with position or positional play in poker.

In the mathematical study of combinatorial games, positional games are games described by a finite set of positions in which a move consists of claiming a previously-unclaimed position. Well-known games that fall into this class include Tic-tac-toe, Hex, and the Shannon switching game.[1][2]

Definition

A positional game may be described by a pair (X,\mathcal{F}) where X is a finite set of positions and \mathcal{F} is a family of subsets of X; X is called the board and the sets in F are called winning sets. The game is played by two players who alternately claim unclaimed elements of the board, until all the elements are claimed. The winner may be determined in several ways:

See also

References

  1. Beck, József (2008). Combinatorial games : tic-tac-toe theory. Cambridge: Cambridge University Press. ISBN 978-0-521-46100-9.
  2. Hefetz, Dan; Krivelevich, Michael; Stojaković, Miloš; Szabó, Tibor (2014). Positional Games. Basel: Birkhäuser Verlag GmbH. ISBN 978-3-0348-0824-8.
This article is issued from Wikipedia - version of the Tuesday, April 26, 2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.