When.com Web Search

  1. Ads

    related to: chess problems and solutions

Search results

  1. Results From The WOW.Com Content Network
  2. 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 defen

  3. Eight queens puzzle - Wikipedia

    en.wikipedia.org/wiki/Eight_queens_puzzle

    The eight queens puzzle is the problem of placing eight chess queens on an 8×8 chessboard so that no two queens threaten each other; thus, a solution requires that no two queens share the same row, column, or diagonal. There are 92 solutions. The problem was first posed in the mid-19th century.

  4. Glossary of chess problems - Wikipedia

    en.wikipedia.org/wiki/Glossary_of_chess_problems

    A chess problem theme in which the solution includes pawn promotions to all possible pieces (in orthodox chess, to bishop, knight, rook and queen; in fairy chess, possibly to fairy pieces). anti-Bristol The interference of one black piece by another like-moving one on the same line (if the pieces are on different lines, it is a Holzhausen).

  5. Mathematical chess problem - Wikipedia

    en.wikipedia.org/wiki/Mathematical_chess_problem

    A mathematical chess problem is a mathematical problem which is formulated using a chessboard and chess pieces. These problems belong to recreational mathematics.The most well-known problems of this kind are the eight queens puzzle and the knight's tour problem, which have connection to graph theory and combinatorics.

  6. Chess puzzle - Wikipedia

    en.wikipedia.org/wiki/Chess_puzzle

    Chess problems are divided into orthodox and heterodox types, both covering a variety of genres. Orthodox problems employ the standard rules of chess and involve positions that can legally arise from actual gameplay. The most common form of orthodox problem is the directmate, which stipulates checkmate in n moves, usually two or three. The ...

  7. Solving chess - Wikipedia

    en.wikipedia.org/wiki/Solving_chess

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