First player win
|This article needs additional citations for verification. (March 2009)|
In game theory, a two-player 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.
- "Checkers Is Solved - Schaeffer et al. 317 (5844): 1518 - Science". Sciencemag.org. Retrieved 2008-11-24.
|This applied mathematics-related article is a stub. You can help Wikipedia by expanding it.|