Live briefing
Everything about Solved game
Game whose outcome can be correctly predicted
A solved game is a game whose outcome can be correctly predicted from any position, assuming that both players play perfectly. This concept is usually applied to abstract strategy games, and especially to games with full information and no element of chance; solving such a game may use combinatorial game theory or computer assistance. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Solved gameA 5-minute orientation
- Skim a recent paper: Genome-resolved metagenomics: a game changer for microbiome medicineInfluential work since 2022
- Pick up a classic book: Scooby-Doo! Read and SolveThe most-reprinted book on the subject
- Read the landmark paper: Crystal structure of a monomeric retroviral protease solved by protein folding game playersCited 403 times
- Go sideways: Solving chessA closely related topic
- Go sideways: M,n,k-gameA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Crystal structure of a monomeric retroviral protease solved by protein folding game players
Multidisciplinary topology optimization solved as a Nash game
Robust Control of Unknown Observable Nonlinear Systems Solved as a Zero-Sum Game
Horizontal variable-speed interception game solved by forced singular perturbation technique
Three ancient problems solved by using the game theory logic based on the Shapley value
Erratum: Crystal structure of a monomeric retroviral protease solved by protein folding game players
Game of Life mystery is solved
Los Alamos chess game 2 (after P-K3) is solved; black wins in 21 moves
🆕 Influential since 2022
📚 Books worth reading
Scooby-Doo! Read and SolveGail Herman · 2006- 📕Mathematics in Games, Sports, and GamblingRonald J. Gould · 2009
What computers still can't doHubert L. Dreyfus · 1972
Game TheoryDrew Fudenberg, Jean Tirole · 1991
Games, puzzles, and computationRobert A. Hearn, Erik D. Demaine · 2009
The big book of team-motivating gamesEdward E. Scannell, Mary Scannell · 2009
Thinking in BetsAnnie Duke · 2018
A course in game theoryMartin J. Osborne · 1994
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Solving chess Solving chess consists of finding an optimal strategy for the game of chess; that is, one by which one of the players (White or Black) can always force…
- M,n,k-game An m,n,k-game is an abstract board game in which two players take turns in placing a stone of their color on an m-by-n board, the winner being the player…
- Endgame tablebase In chess, an endgame tablebase, or simply tablebase, is a computerised database containing precalculated evaluations of endgame positions. Tablebases are…
- First-player and second-player win 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…
- Hex (board game) Hex (also called Nash) is a two-player abstract strategy board game in which players attempt to connect opposite sides of a rhombus-shaped board made of…
- Losing chess Losing chess is one of the most popular chess variants. The objective of each player is to lose all of their pieces or be stalemated. Players must make…
- Combinatorial game theory Combinatorial game theory is a branch of mathematics and theoretical computer science that typically studies sequential games with perfect information…
- Minichess Minichess is a family of chess variants played with regular chess pieces and standard rules, but on a smaller board. The motivation for these variants…