Chess puzzle

From Wikipedia, the free encyclopedia

A Chess puzzle is a puzzle in which knowledge of the pieces and rules of chess is used to logically solve a chess-related problem. The longstanding popularity of chess has paved the way for a rich tradition of such chess-related puzzles and composed problems, which assume a familiarity with the pieces and rules of chess, but can set different objectives than a standard game.

Some chess puzzles may derive from studies which were intended to help a student of the game learn how to seal a victory, but have since evolved into an entirely separate art.

Examples of a chess puzzle include deducing the last move played, the location of a missing piece, or whether a player has lost the right to castle. Sometimes the objective is antithetical to normal chess, such as helping (or even compelling) the opponent to checkmate one's own king.

Contents

Main article: Chess problem

Whereas the term chess puzzle refers broadly to any puzzle involving aspects of chess, a chess problem is an orthodox puzzle (see below) in which one must play and win a game, starting with a certain composition of pieces on the chess board, and playing within the standard rules of chess.

Orthodox chess puzzles involve positions that can arise from actual game play (although the process of getting to that position may be unrealistic). The most common orthodox chess puzzle takes the form of checkmate in N moves. The puzzle positions are seldom similar to positions from actual play, and the challenge is not to find a winning move, but rather to find the (usually unique) move which forces checkmate as rapidly as possible.

Chess puzzles can also be regular positions from a game (with normal rules), usually meant as training positions, tactical or positional, from all phases of the game (openings, middlegame of endings). These are known as tactical puzzles. They can range from a simple "Mate in one" combination to a complex attack on the opponents king. Solving tactical chess puzzles is a very common chess teaching technique. Although it is unlikely that the same position will occur in a game the student plays, the recognition of certain patterns can help to find a good move or plan in another position.

Heterodox chess puzzles involve conditions that are impossible with normal play, such as multiple Kings or chess variants, while fairy puzzles employ pieces not used in orthodox chess, such as the amazon (a piece combining the powers of the queen and the knight).

One of the many types of chess puzzles is to deduce the location of invisible pieces based on information about how many times certain squares are attacked. For example, in the position below, the challenge is to place a white king, queen, rook, knight, and bishop in the five highlighted squares so that the squares with numbers in them are attacked zero and four times respectively.

image:chess_puzzle.png image:chess_puzzle_pieces.png
Spoiler warning: (The solution to the puzzle above is revealed below)


The solution is to place the queen at a1 (the only place where it doesn't attack a6), king at d6 (the only place where it attacks c6), rook at c8, bishop at a4 and knight at a7.

Advanced Search
Included Web Search Engines


Safe Search

close

Top Matching Results

Occasionally Search.com will highlight specialized results that are based on the context of your query. Examples of specialized results include specific links to news, images, or video.

Top Matching Results may highlight information from other Search.com pages, content from the CNET Network of sites, or third party content. The listings are based purely on relevance. Search.com does not receive payment for listings in this section but our partners that provide this data may get paid for listing these products.

Sponsored Links

This section contains paid listings which have been purchased by companies that want to have their sites appear for specific search terms and related content. These listings are administered, sorted and maintained by a third party and are not endorsed by Search.com.

Search Results

Search.com sends your search query to several search engines at one time and integrates the results into one list which has been sorted by relevance using Search.com's proprietary algorithm. You can customize the list of search engines included in your metasearch from the preferences.

The search engines that are used in your metasearch may allow companies to pay to have their Web sites included within the results. To view the Paid Inclusion policy for a specific search engine, please visit their Web site. Search.com does not accept payment or share revenue with any search engine partner for listings in this section.