enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Chess puzzle - Wikipedia

    en.wikipedia.org/wiki/Chess_puzzle

    Chess puzzles can also be regular positions from actual games, usually meant as tactical training positions. They can range from a simple "Mate in one" combination to a complex attack on the enemy king. Solving tactical chess puzzles is a very common chess teaching technique. They are helpful in pattern recognition.

  3. Glossary of chess problems - Wikipedia

    en.wikipedia.org/wiki/Glossary_of_chess_problems

    A piece in a chess problem that is legally placed and could only have been created through promotion. It does not include pieces promoted after the initial problem position. orthochess Synonym for orthodox chess. [5] orthodox chess Chess according to FIDE's The Official Laws of Chess; [6] see Rules of chess.

  4. List of chess variants - Wikipedia

    en.wikipedia.org/wiki/List_of_chess_variants

    Thrones Chess, initial setup with the classic chess pieces. Free squares may be filled by additional classic or fairy chess pieces. Zonal chess: Board has triangular wings or "zones" on either side of the main 8×8 board. Queens, bishops, and rooks that start from one of the squares in either zone may change direction and keep going on the same ...

  5. Chess problem - Wikipedia

    en.wikipedia.org/wiki/Chess_problem

    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 a particular task. For instance, a position may be given with the instruction that White is to move first, and checkmate Black in two moves against any possible defence.

  6. Plaskett's Puzzle - Wikipedia

    en.wikipedia.org/wiki/Plaskett's_Puzzle

    Plaskett's Puzzle is a chess endgame study created by the Dutch endgame composer Gijs van Breukelen (February 27, 1946 – December 21, 2022) around 1970, although not published at the time. Van Breukelen published the puzzle in 1990 in the Netherlands chess magazine Schakend Nederland .

  7. Selfmate - Wikipedia

    en.wikipedia.org/wiki/Selfmate

    The puzzle is based on a 1922 342-move composition by Ottó Titusz Bláthy, which was later found to be cooked. [citation needed] Prior to December 2021, the record for the longest selfmate problem was a 359-move problem, created by Andriy Stetsenko in 2016. [4] Unfortunately, this problem was later found to be cooked, as a shorter solution exists.

  8. Immortal Zugzwang Game - Wikipedia

    en.wikipedia.org/wiki/Immortal_Zugzwang_Game

    Animation of the game. The Immortal Zugzwang Game is a chess game between Friedrich Sämisch and Aron Nimzowitsch, played in Copenhagen in March 1923. It gained its name because the final position is sometimes considered a rare instance of zugzwang occurring in the middlegame. [1]

  9. Excelsior (chess problem) - Wikipedia

    en.wikipedia.org/wiki/Excelsior_(chess_problem)

    Loyd had a friend who was willing to wager that he could always find the piece which delivered the principal mate of a chess problem. Loyd composed this problem as a joke and bet his friend dinner that he could not pick a piece that didn't give mate in the main line (his friend immediately identified the pawn on b2 as being the least likely to deliver mate), and when the problem was published ...