Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Solved_game> ?p ?o. }
Showing items 1 to 30 of
30
with 100 items per page.
- Solved_game abstract "A solved game is a game whose outcome (win, lose, or draw) can be correctly predicted from any position, given that both players play perfectly. Games which have not been solved are said to be "unsolved". Games for which only some positions have been solved are said to be "partially solved". This article focuses on two-player games that have been solved.A two-player game can be "solved" on several levels: Ultra-weak Proving whether the first player will win, lose, or draw from the initial position, given perfect play on both sides. This proof can be non-constructive (possibly involving a strategy-stealing argument) that need not determine any moves of the perfect play. Weak Providing an algorithm that secures a win for one player or a draw for either against any possible moves by the opponent from the beginning of the game by producing at least one complete ideal game (all moves start to end) with proof that each move is optimal for the player making it. It need not enable a computer program using the solution to optimally play against an imperfect opponent. For example, the checkers program Chinook will never turn a drawn position into a losing position (the weak solution of checkers proves that it is a draw) but it might turn a winning position into a drawn position because Chinook expects the opponent not to play a move that will not win but could lose, and it therefore incompletely analyzes these moves. Strong The strongest sense of solution requires an algorithm which can produce perfect play (moves) from any position, i.e. even if mistakes have already been made on one or both sides.A minimax algorithm can exhaustively traverse the game tree of any two-person game that has finitely many positions. For many non-trivial games this algorithm would require too much time to generate a move in a given position; a game therefore is not considered to be weakly or strongly solved unless existing hardware can reasonably quickly run the algorithm. Many algorithms rely on a huge database and are effectively nothing more.For example of a strong solution consider the game of tic-tac-toe, which is solvable as a draw for both players with perfect play (a result even manually determinable by schoolchildren). Games like nim also admit a rigorous analysis using combinatorial game theory.Even a strongly solved game can remain interesting if its solution is too complex to be memorized; conversely, a weakly solved game may lose its attraction if the winning strategy is simple enough to remember (e.g. Maharajah and the Sepoys). An ultra-weak solution (e.g. Chomp or Hex on a sufficiently large board) generally does not affect playability.".
- Solved_game wikiPageExternalLink gamescrafters.berkeley.edu.
- Solved_game wikiPageExternalLink hard.html.
- Solved_game wikiPageID "63763".
- Solved_game wikiPageRevisionID "601282413".
- Solved_game hasPhotoCollection Solved_game.
- Solved_game subject Category:Abstract_strategy_games.
- Solved_game subject Category:Combinatorial_game_theory.
- Solved_game subject Category:Mathematical_games.
- Solved_game type AbstractStrategyGames.
- Solved_game type Abstraction100002137.
- Solved_game type Contest107456188.
- Solved_game type Event100029378.
- Solved_game type Game100456199.
- Solved_game type MathematicalGames.
- Solved_game type PsychologicalFeature100023100.
- Solved_game type SocialEvent107288639.
- Solved_game type YagoPermanentlyLocatedEntity.
- Solved_game comment "A solved game is a game whose outcome (win, lose, or draw) can be correctly predicted from any position, given that both players play perfectly. Games which have not been solved are said to be "unsolved". Games for which only some positions have been solved are said to be "partially solved".".
- Solved_game label "Gelöste Spiele".
- Solved_game label "Solved game".
- Solved_game label "已解遊戲".
- Solved_game sameAs Gelöste_Spiele.
- Solved_game sameAs 풀린_게임.
- Solved_game sameAs m.0h3b9.
- Solved_game sameAs Q573520.
- Solved_game sameAs Q573520.
- Solved_game sameAs Solved_game.
- Solved_game wasDerivedFrom Solved_game?oldid=601282413.
- Solved_game isPrimaryTopicOf Solved_game.