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 a victory, or either can force a draw (see solved game). It is also related to more generally solving chess-like games (i.e. combinatorial games of perfect information) such as Capablanca chess and infinite chess. In a weaker sense, solving chess may refer to proving which one of the three possible outcomes (White wins; Black wins; draw) is the result of two perfect players, without necessarily revealing the optimal strategy itself (see indirect proof).[1]
No complete solution for chess in either of the two senses is known, nor is it expected that chess will be solved in the near future (if ever). There is disagreement on whether the current exponential growth of computing power will continue long enough to someday allow for solving it by "brute force", i.e. by checking all possibilities. Progress to date is extremely limited; there are tablebases of perfect endgame play with a small number of pieces (up to seven), and some chess variants have been solved at least weakly. Calculated estimates of game-tree complexity and state-space complexity of chess exist which provide a bird's eye view of the computational effort that might be required to solve the game.
^
Allis, V. (1994). "PhD thesis: Searching for Solutions in Games and Artificial Intelligence" (PDF). Department of Computer Science. University of Limburg. Retrieved 2012-07-14.
a victory, or either can force a draw (see solved game). It is also related to more generally solvingchess-like games (i.e. combinatorial games of perfect...
gained by participating in the official World ChessSolving Championship (WCSC): to become a GM, a solver must score at least 90 percent of the winner's...
The World ChessSolving Championship (WCSC) is an annual competition in the solving of chess problems (also known as chess puzzles) organized by the World...
A chess problem, also called a chess composition, is a puzzle set by the composer using chess pieces on a chess board, which presents the solver with a...
completely solvingchess are generally considered to be rather remote. It is widely conjectured that no computationally inexpensive method to solvechess exists...
Grandmasters for chess composition, for both chess problems and studies International Honorary Masters for chess composition International Solving Grandmasters...
chess events include the Chess Olympiad and the European Team Chess Championship. The World ChessSolving Championship and World Correspondence Chess...
[citation needed] Lambs and tigers Weakly solved by Yew Jin Lim (2007). The game is a draw. Chess Fully solvingchess remains elusive, and it is speculated...
Titles for correspondence chess, chess problem composition and chess problem solving are no longer administered by FIDE. A chess title, usually in an abbreviated...
(born 25 April 1955) is an English chess grandmaster, a three-time world champion in chess problem solving, a chess writer and publisher, and a mathematician...
and open-source Internet chess server run by a non-profit organization of the same name. Users of the site can play online chess anonymously and optionally...
a list of unorthodox chess pieces, see Fairy chess piece; for a list of terms specific to chess problems, see Glossary of chess problems; for a list of...
the game-tree complexity of chess, resulting in about 10120 possible games, to demonstrate the impracticality of solvingchess by brute force, in his 1950...
players by 2015. While solvingchess has not yet been achieved, some variants have been found to be simple enough to be solved though computer analysis...
A chess piece, or chessman, is a game piece that is placed on a chessboard to play the game of chess. It can be either white or black, and it can be one...
In chess, en passant (French: [ɑ̃ pasɑ̃], lit. "in passing") describes the capture by a pawn of an enemy pawn on the same rank and an adjacent file that...
are also chess world championships in rapid, blitz, correspondence, problem solving, Fischer random chess, and computer chess. The game of chess in its...
former is an example of simple problem solving (SPS) addressing one issue, whereas the latter is complex problem solving (CPS) with multiple interrelated obstacles...
designed to solve, or assist people in creating or solving, chess problems – puzzles in which pieces are laid out as in a game of chess, and may at times...
The Encyclopaedia of Chess Openings (ECO) is a reference work describing the state of opening theory in chess, originally published in five volumes from...
Correspondence chess is chess played by various forms of long-distance correspondence, traditionally through the postal system. Today it is usually played...
In chess, by far the most common scoring system is 1 point for a win, ½ for a draw, and 0 for a loss. A number of different notations are used to denote...
The World Blitz Chess Championship is a chess tournament held to determine the world champion in chess played under blitz time controls. Since 2012, FIDE...
The Benoni Defense, or simply the Benoni, is a chess opening characterized by an early reply of ...c5 against White's opening move 1.d4. The original...
World Computer Chess Championship (WCCC) is an event held periodically since 1974 where computer chess engines compete against each other. The event is...
Immortal Game was a chess game played in 1851 by Adolf Anderssen and Lionel Kieseritzky. It was played while the London 1851 chess tournament was in progress...
The Dutch Defence is a chess opening characterised by the moves: 1. d4 f5 Black's 1...f5 stakes a claim to the e4-square and envisions an attack in the...
Global Information