First-player and second-player win (original) (raw)
In combinatorial game theory, a two-player deterministic perfect information turn-based game is a first-player-win if with perfect play the first player to move can always force a win. Similarly, a game is second-player-win if with perfect play the second player to move can always force a win. With perfect play, if neither side can force a win, the game is a draw. With perfect play, checkers has been determined to be a draw; neither player can force a win. Another example of a game which leads to a draw with perfect play is tic-tac-toe, and this includes play from any opening move.
| Property | Value |
|---|---|
| dbo:abstract | In combinatorial game theory, a two-player deterministic perfect information turn-based game is a first-player-win if with perfect play the first player to move can always force a win. Similarly, a game is second-player-win if with perfect play the second player to move can always force a win. With perfect play, if neither side can force a win, 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. The classic game of Connect Four has been mathematically proven to be first-player-win. With perfect play, checkers has been determined to be a draw; neither player can force a win. Another example of a game which leads to a draw with perfect play is tic-tac-toe, and this includes play from any opening move. Significant theory has been completed in the effort to solve chess. It has been speculated that there may be first-move advantage which can be detected when the game is played imperfectly (such as with all humans and all current chess engines). However, with perfect play, it remains unsolved as to whether the game is a first-player win (White), a second player win (Black), or a forced draw. (en) |
| dbo:thumbnail | wiki-commons:Special:FilePath/Tictactoe-X.svg?width=300 |
| dbo:wikiPageID | 22071697 (xsd:integer) |
| dbo:wikiPageLength | 3777 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID | 1094173079 (xsd:integer) |
| dbo:wikiPageWikiLink | dbr:Nim dbr:Determinacy dbc:Game_theory dbc:Mathematical_games dbr:Connect_Four dbr:Chess_engine dbr:English_draughts dbr:Combinatorial_game_theory dbr:Tic-tac-toe dbr:Game_tree dbr:Draw_(tie) dbr:Strategy-stealing_argument dbr:Solved_game dbr:Zugzwang dbr:First-move_advantage_in_chess dbr:Perfect_information dbr:Solving_chess dbr:Sequential_game dbr:File:Tictactoe-X.svg |
| dbp:wikiPageUsesTemplate | dbt:Reflist dbt:Mathapplied-stub dbt:Game_theory |
| dcterms:subject | dbc:Game_theory dbc:Mathematical_games |
| rdfs:comment | In combinatorial game theory, a two-player deterministic perfect information turn-based game is a first-player-win if with perfect play the first player to move can always force a win. Similarly, a game is second-player-win if with perfect play the second player to move can always force a win. With perfect play, if neither side can force a win, the game is a draw. With perfect play, checkers has been determined to be a draw; neither player can force a win. Another example of a game which leads to a draw with perfect play is tic-tac-toe, and this includes play from any opening move. (en) |
| rdfs:label | First-player and second-player win (en) |
| owl:sameAs | wikidata:First-player and second-player win https://global.dbpedia.org/id/4k41y |
| prov:wasDerivedFrom | wikipedia-en:First-player_and_second-player_win?oldid=1094173079&ns=0 |
| foaf:depiction | wiki-commons:Special:FilePath/Tictactoe-X.svg |
| foaf:isPrimaryTopicOf | wikipedia-en:First-player_and_second-player_win |
| is dbo:wikiPageRedirects of | dbr:First_player_win dbr:First-player-win dbr:First-player_win dbr:Second-player-win dbr:Second-player_win dbr:Second_player_win |
| is dbo:wikiPageWikiLink of | dbr:First_player_win dbr:First-player-win dbr:First-player_win dbr:Second-player-win dbr:Second-player_win dbr:Second_player_win |
| is foaf:primaryTopic of | wikipedia-en:First-player_and_second-player_win |
