Allumwandlung

From Wikipedia, the free encyclopedia

This article uses algebraic notation to describe chess moves.
Niels Hoeg
1905
Image:chess_zhor_26.png
Image:chess_zver_26.png
a8 b8 c8 d8 e8 f8 g8 h8
a7 b7 c7 d7 e7 f7 g7 h7
a6 b6 c6 d6 e6 f6 g6 h6
a5 b5 c5 d5 e5 f5 g5 h5
a4 b4 c4 d4 e4 f4 g4 h4
a3 b3 c3 d3 e3 f3 g3 h3
a2 b2 c2 d2 e2 f2 g2 h2
a1 b1 c1 d1 e1 f1 g1 h1
Image:chess_zver_26.png
Image:chess_zhor_26.png
Mate in three. A chess problem with Allumwandlung.

Allumwandlung (German for "complete promotion", sometimes shortened to AUW) is a chess problem where, at some stage in the solution, the pawn (or sometimes pawns) is promoted variously to a knight, bishop, rook and queen.

At right is a chess problem composed by Niels Hoeg and first published in 1905. White to move and mate in three. The key move (white's first move) is 1.f7, and depending on how black defends, white promotes to either a queen, a rook, a bishop or a knight on move two. The lines are:

1... e4 2. f8Q any 3. Qe7 mate (or Qf6 mate)
1... Kd6 2. f8Q Kc6 3. Qc5 mate
1... exf4 2. f8R Kd6 3. Rf6 mate
1... exd4 2. f8B Kf6 3. Ra6 mate
1... Kf6 2. f8N exd4 3. Rf7 mate

The importance of white's underpromotions can be understood by considering what happens if he promotes to a queen no matter what black plays: after 1... exf4 or 1... exd4 2. f8Q is stalemate, while following 1... Kf6 2. f8Q Kxg6 there is no mate.

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.