First-player and second-player win

In game theory, a two-player deterministic perfect-information turn-based game is first-player-win if a perfect player who plays first can always force a win. Similarly, a game is second-player-win if a perfect player who plays second can always force a win. When winning is not possible with perfect play by both opposing sides, the game is a draw.

Some games with relatively small game trees have been proven to be first or second player wins. For example, the game of nim with the classic 3–4–5 starting position is a first-player-win game. However, Nim with the 1-3-5-7 starting position is a second-player-win game. The classic game of Connect Four has been mathematically proven to be first-player-win.

The first player in checkers, can only guarantee themselves a draw under perfect play.[1] Another example of a draw game is tic-tac-toe.

It remains a matter of conjecture as to whether other games such as chess are first-player-wins; see the article first-move advantage in chess for more on this.

See also

References

  1. ↑ "Checkers Is Solved – Schaeffer et al. 317 (5844): 1518 – Science". Sciencemag.org. Retrieved 2008-11-24.


This article is issued from Wikipedia - version of the 6/28/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.