When.com Web Search

  1. Ad

    related to: chess algebraic notation solver

Search results

  1. Results From The WOW.Com Content Network
  2. Algebraic notation (chess) - Wikipedia

    en.wikipedia.org/wiki/Algebraic_notation_(chess)

    Descriptive notation was usual in the Middle Ages in Europe. A form of algebraic chess notation that seems to have been borrowed from Muslim chess, however, appeared in Europe in a 12th century manuscript referred to as "MS. Paris Fr. 1173 (PP.)". The files run from a to h, just as they do in the current standard algebraic notation. The ranks ...

  3. Proof game - Wikipedia

    en.wikipedia.org/wiki/Proof_game

    This article uses algebraic notation to describe chess moves. A proof game is a type of retrograde analysis chess problem . The solver must construct a game starting from the initial chess position, which ends with a given position (thus proving that that position is reachable) after a specified number of moves.

  4. Chess notation - Wikipedia

    en.wikipedia.org/wiki/Chess_notation

    The notation for chess moves evolved slowly, as these examples show. The last is in algebraic chess notation; the others show the evolution of descriptive chess notation and use spelling and notation of the period. 1614: The white king commands his owne knight into the third house before his owne bishop. 1750: K. knight to His Bishop's 3d.

  5. Retrograde analysis - Wikipedia

    en.wikipedia.org/wiki/Retrograde_analysis

    This article uses algebraic notation to describe chess moves. In chess problems , retrograde analysis is a technique employed to determine which moves were played leading up to a given position. While this technique is rarely needed for solving ordinary chess problems, there is a whole subgenre of chess problems in which it is an important part ...

  6. Portable Game Notation - Wikipedia

    en.wikipedia.org/wiki/Portable_Game_Notation

    Portable Game Notation (PGN) is a standard plain text format for recording chess games (both the moves and related data), which can be read by humans and is also supported by most chess software. This article uses algebraic notation to describe chess moves.

  7. Selfmate - Wikipedia

    en.wikipedia.org/wiki/Selfmate

    A selfmate is a chess problem in which White, moving first, must force the unwilling Black to deliver checkmate within a specified number of moves. Selfmates were once known as sui-mates . This article uses algebraic notation to describe chess moves.

  8. Solving chess - Wikipedia

    en.wikipedia.org/wiki/Solving_chess

    [6] [10] The number of mathematical operations required to solve chess, however, may be significantly different than the number of operations required to produce the entire game-tree of chess. In particular, if White has a forced win, only a subset of the game-tree would require evaluation to confirm that a forced-win exists (i.e. with no ...

  9. Vienna Game, Würzburger Trap - Wikipedia

    en.wikipedia.org/wiki/Vienna_Game,_Würzburger_Trap

    The Würzburger Trap is a chess opening trap in the Vienna Gambit. It was named around 1930 for German banker Max Würzburger. It was named around 1930 for German banker Max Würzburger. This article uses algebraic notation to describe chess moves.