Live briefing
Everything about Solving chess
Finding an optimal algorithm for playing chess
Solving chess consists of finding an optimal strategy for the game of chess; that is, one by which one of the players can always force either a victory or a draw. It is also related to more generally solving chess-like games such as Capablanca chess and infinite chess. In a weaker sense, solving chess may refer to proving which one of the three possible outcomes is the result of two perfect players, without necessarily revealing the optimal strategy itself. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Solving chessA 5-minute orientation
- Skim a recent paper: Solving Multiobjective Fuzzy Job-Shop Scheduling Problem by a Hybrid Adaptive Differential Evolution AlgorithmInfluential work since 2022
- Pick up a classic book: Thought and choice in chessThe most-reprinted book on the subject
- Read the landmark paper: The Cosmic Linear Anisotropy Solving System (CLASS). Part II: Approximation schemesCited 2,169 times
- Go sideways: Endgame tablebaseA closely related topic
- Go sideways: Solved gameA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
The Cosmic Linear Anisotropy Solving System (CLASS). Part II: Approximation schemes
Psychophysiological stress response of adolescent chess players during problem-solving tasks
Mathematical Problem-Solving Abilities and Chess
Dynamics of the Prefrontal Cortex during Chess-Based Problem-Solving Tasks in Competition-Experienced Chess Players: An fNIR Study
Some characteristics of human problem-solving in chess
Chess and problem solving involving patterns
The Effect of Chess on Cognitive Flexibility and Problem Solving Skills: Descriptive Research
Cognitive Model of Problem-Solving in Chess
🆕 Influential since 2022
Solving Multiobjective Fuzzy Job-Shop Scheduling Problem by a Hybrid Adaptive Differential Evolution Algorithm
Comparison of chemical and biological degradation of sulfonamides: Solving the mystery of sulfonamide transformation
An Improved Artificial Bee Colony Algorithm With Q-Learning for Solving Permutation Flow-Shop Scheduling Problems
Metacognitive Profile of Students Who Play Chess in Solving Mathematics Problems
The Influence of Attitude Towards the Subject of Chess on the Success of Solving Chess Problems: Results of Multidimensional Modeling
📚 Books worth reading
Thought and choice in chessAdriaan D. de Groot · 1978
Imagination in ChessPaata Gaprindashvili · 2004
ChessHelmut Pfleger, Gerd Treppner · 1988
Science, Math, CheckmateAlexey W. Root · 2008- 📕Chess players' strategies for the direction of the mindPertti Saariluoma · 1980
- 📕ChessPfleger, Helmut · 1988
- 📕Coding problem spaces in chessPertti Saariluoma · 1984
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Endgame tablebase In chess, an endgame tablebase, or simply tablebase, is a computerised database containing precalculated evaluations of endgame positions. Tablebases are…
- Solved game A solved game is a game whose outcome (win, lose or draw) can be correctly predicted from any position, assuming that both players play perfectly. This…
- Combinatorial game theory Combinatorial game theory is a branch of mathematics and theoretical computer science that typically studies sequential games with perfect information…
- Computer chess Computer chess includes both hardware (dedicated computers) and software capable of playing chess. Computer chess provides opportunities for players to…
- Combinatorial explosion In mathematics, a combinatorial explosion is the rapid growth of the complexity of a problem due to the way its combinatorics depends on input, constraints…
- Game complexity Combinatorial game theory measures game complexity in several ways: State-space complexity (the number of legal game positions from the initial position)…
- Evaluation function An evaluation function, also known as a heuristic evaluation function or static evaluation function, is a function used by game-playing computer programs…
- 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…