always force either a victory or a draw (see solved game). It is also related to more generally solving chess-like games (i.e. combinatorial games of perfect...

A chess problem, also called a chess composition, is a puzzle created by the composer using chess pieces on a chessboard, which presents the solver with...

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 World Chess Solving Championship (WCSC) is an annual competition in the solving of chess problems (also known as chess puzzles) organized by the World...

chess events include the Chess Olympiad and the European Team Chess Championship. The World Chess Solving Championship and World Correspondence Chess...

gained by participating in the official World Chess Solving Championship (WCSC): to become a GM, a solver must score at least 90 percent of the winner's...

completely solving chess are generally considered to be rather remote. It is widely conjectured that no computationally inexpensive method to solve chess exists...

Losing chess was weakly solved in 2016 by Mark Watkins as a win for White, beginning with 1.e3. This article uses algebraic notation to describe chess moves...

players by 2015. While solving chess has not yet been achieved, some variants have been found to be simple enough to be solved through computer analysis...

least 1889, when the first World Chess Champion, Wilhelm Steinitz, addressed the issue, although chess has not been solved. Since 1851, compiled statistics...

Grandmasters for chess composition, for both chess problems and studies International Honorary Masters for chess composition International Solving Grandmasters...

[citation needed] Lambs and tigers Weakly solved by Yew Jin Lim (2007). The game is a draw. Chess Fully solving chess remains elusive, and it is speculated...

as the Automaton Chess Player (German: Schachtürke, lit. 'chess Turk'; Hungarian: A Török), or simply The Turk, was a fraudulent chess-playing machine...

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...

(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...

Titles for correspondence chess, chess problem composition and chess problem solving are no longer administered by FIDE. A chess title, usually in an abbreviated...

Romantic chess is a style of chess popular in the 18th century until its decline in the 1880s. This style of chess emphasizes quick, tactical maneuvers...

the game-tree complexity of chess, resulting in about 10120 possible games, to demonstrate the impracticality of solving chess by brute force, in his 1950...

In the game of chess, an endgame study, or just study, is a type of chess problem that starts with a composed position—i.e. one that has been made up rather...

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...

Correspondence chess is chess played by various forms of long-distance correspondence, traditionally through the postal system. Today it is usually played...

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 Encyclopaedia of Chess Openings (ECO) is a reference work describing the state of opening theory in chess, originally published in five volumes from...

former is an example of simple problem solving (SPS) addressing one issue, whereas the latter is complex problem solving (CPS) with multiple interrelated obstacles...

The Immortal Game was a chess game played in 1851 between Adolf Anderssen and Lionel Kieseritzky during the London 1851 chess tournament, an event in...

solved, as illustrated in the following table. One example in a game where combinatorial complexity leads to a solvability limit is in solving chess (a...

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...

The Oxford Companion to Chess is a reference book on the game of chess written by David Vincent Hooper and Kenneth Whyld. The book is written in an encyclopedia...

The Benko Gambit (or Volga Gambit) is a chess opening characterised by the move 3...b5 in the Benoni Defence arising after: 1. d4 Nf6 2. c4 c5 3. d5 b5...

The Réti Opening is a hypermodern chess opening whose "traditional" or "classic method" begins with the moves: 1. Nf3 d5 2. c4 White attacks Black's pawn...