Changes

Jump to: navigation, search

Promotions

7,803 bytes added, 12:31, 8 May 2018
Created page with "'''Home * Chess * Moves * Promotions''' FILE:Queening_Pawn.jpg|border|right|thumb|link=http://www.carinajorgensen.com/Chess/pawnqueen.php|[[Arts#J%F8r..."
'''[[Main Page|Home]] * [[Chess]] * [[Moves]] * Promotions'''

[[FILE:Queening_Pawn.jpg|border|right|thumb|link=http://www.carinajorgensen.com/Chess/pawnqueen.php|[[Arts#J%F8rgensen|Carina Jørgensen]] - Queening Pawn <ref>[http://www.carinajorgensen.com/Chess/pawnqueen.php Queening Pawn] by [[Arts#J%F8rgensen|Carina Jørgensen]], 2008</ref> ]]

'''Promotions''' are [[Tactical Moves|tactical moves]] changing [[Material#Balance|material balance]] where a [[Pawn|pawn]] reaches its [[Promotion Square|promotion square]] on the eighth (or first) [[Ranks|rank]] to transform to a [[Pieces|piece]] of the players choice, either a [[Queen|queen]], [[Knight|knight]], [[Rook|rook]] or [[Bishop|bishop]] of the same [[Color|color]]. The pawn may reach the eighth rank due to a [[Pawn Push|pawn push]] or [[Captures|capture]]. A pawn promoting to a queen while capturing the opponent queen defines the maximum amount of [[Material|material]] a move may gain.

=Piece counts=
Since theoretical each pawn may promote, the number of pawns, eight, per side defines the maximum number of pieces, that is one side may have up to nine queens, or ten knights, as well as bishops or rooks. The maximum sum of these pieces, seven of the [[Initial Position|initial position]], is fifteen.
<span id="MinorPromotion"></span>
=Queening versus Minor Promotions=
Most often in practical play promotions occur to the strongest piece, the queen, also referred as '''queening'''. A promotion to other than the queen is called minor- or underpromotion, where once in a while the promotion to a knight has some practical relevance due to its distinct attacking with the possibility to check <ref>[https://en.wikipedia.org/wiki/Lasker_Trap Lasker Trap from Wikipedia] features an underpromotion as early as the seventh move</ref> or to fork, see for instance what happened at [[ACM 1991#KnightPromotion]] in [https://en.wikipedia.org/wiki/Albuquerque%2C_New_Mexico Albuquerque] to [[Lachex]]<ref>Page 18 in the [http://archive.computerhistory.org/projects/chess/related_materials/text/3-1%20and%203-2%20and%203-3%20and%204-3.1993_23rd_ACM_ICCC/1993%20ICCC.062303066.sm.pdf PDF report ]</ref> . Minor promotions to rook and bishop, whose attacks are sub-set of the queen are very rarely about to avoid [[Stalemate|stalemate]] - or may occur at the [[Root|root]] in cases the promoted piece may be captured immediately anyway. In [[Encoding Moves|move encoding]] the promoted piece requires two extra bits.

=Minor Generation=
In [[Move Generation|move generation]] it is quite common while producing the queen promotion, also to generate all the additional minor promotions, that is to write four moves to a [[Move List|move list]] with all two-bit combinations indicating the promoted piece, instead of one. However, some programs only generate queening and use [[Unmake Move|unmake move]] of a queen promotion as trigger to conditionally generate further minor promotions, assuming the queen promotion didn't fail high or its refutation was not an immediate capture. Bishop and rook promotions may only generated if the queen promotion returns an explicit stalemate score. Other programs even omit minor promotions or at least underpromotions to rook and bishop inside their [[Search|search]] except the root at all, with the motivation the reduced code and [[Branching Factor|branching factor]] likely pays off in practical playing strength. In [[Quiescence Search|quiescence search]] most programs only consider queening.

=GUI Issues=
[[Entering Moves|Entering moves]] by a human operator within a [[GUI|graphical user interface]] requires [https://en.wikipedia.org/wiki/Modality_%28human-computer_interaction%29 modal] [https://en.wikipedia.org/wiki/Interaction interaction], for instance [https://en.wikipedia.org/wiki/Drag-and-drop dragging] the piece with a [https://en.wikipedia.org/wiki/Mouse_%28computing%29 mouse] from the departure square to a destination square. In case of promotions a [https://en.wikipedia.org/wiki/Modal_window modal dialog] or [https://en.wikipedia.org/wiki/Context_menu pop-up menu] is necessary to choose the promoted piece to finally terminate the modal move entering interaction.

=See also=
* [[ACM 1991#KnightPromotion|ACM 1991 | Mephisto - Lachex]]
* [[Algebraic Chess Notation#Promotions|Algebraic Chess Notation - Promotions]]
* [[Entering Moves]]
* [[Engine Testing#bugs|Famous Bugs]]
* [[Bill Gosper#HAKMEM70|HAKMEM 70]]
* [[Material]]
* [[Promotion Square]]
* [[Quiescence Search]]
* [[Tactical Moves]]

=Publications=
* [[Harold van der Heijden]] ('''1996'''). ''Pawn Promotion''. [https://en.wikipedia.org/wiki/New_in_Chess New in Chess], Alkmaar ISBN 90-5691-005-1
* [https://en.wikipedia.org/wiki/Glen_Downey_%28writer%29 Glen Robert Downey] ('''1998'''). ''The Truth About Pawn Promotion: The Development of the Chess Motif in Victorian Fiction''. Ph.D. thesis, [https://en.wikipedia.org/wiki/University_of_Victoria University of Victoria] [http://www.nlc-bnc.ca/obj/s4/f2/dsk2/tape15/PQDD_0006/NQ34258.pdf pdf] » [[Alice]] <ref>[https://en.wikipedia.org/wiki/Through_the_Looking-Glass Through the Looking-Glass from Wikipedia]</ref>

=Forum Posts=
==1989==
* [https://groups.google.com/d/msg/rec.games.chess/4-it0dcvRIk/0405G7EuKecJ Underpromotion] by [[Ilan Vardi]], [[Computer Chess Forums|rgc]], May 04, 1989
==1990 ...==
* [https://www.stmintz.com/ccc/index.php?id=14777 Underpromoting other than to a knight] by [[David Fotland]], [[CCC]], January 29, 1998
* [https://www.stmintz.com/ccc/index.php?id=72219 Pawn promotion defense] by [[Scott Gasch]], [[CCC]], October 07, 1999
==2000 ...==
* [https://www.stmintz.com/ccc/index.php?id=242025 Promotion frequency] by [[Russell Reagan]], [[CCC]], July 23, 2002
* [https://www.stmintz.com/ccc/index.php?id=366606 Promotion to Knight Wins] by [[Rob Basham]], [[CCC]], May 22, 2004
* [http://www.talkchess.com/forum/viewtopic.php?t=16762 The Perils of missing sub-promotion] by [[Nicolai Czempin]], [[CCC]], September 28, 2007
==2010 ...==
* [http://www.talkchess.com/forum/viewtopic.php?topic_view=threads&p=358597&t=35124 Re: Botvinnik Markov revisited] by [[Don Dailey]], [[CCC]], June 27, 2010 » [[Komodo]]
* [http://www.talkchess.com/forum/viewtopic.php?topic_view=threads&p=335316&t=33059 Strange knight underpromotion by Critter] by [[Richard Vida]], [[CCC]], March 04, 2010
* [http://www.talkchess.com/forum/viewtopic.php?t=42783 Wanted - Bishop promotion FEN] by [[Steven Atkinson]], [[CCC]], March 07, 2012
* [http://www.talkchess.com/forum/viewtopic.php?t=48808 Some statistics about promotions and underpromotions] by [[Jesús Muñoz]], [[CCC]], July 31, 2013
* [http://www.talkchess.com/forum/viewtopic.php?t=49034 Tough promotion bug(s)] by [[Henk van den Belt]], [[CCC]], August 29, 2013
==2015 ...==
* [http://www.talkchess.com/forum/viewtopic.php?t=61601 Stockfish underpromotes much more often than Komodo] by [[Kai Laskos]], [[CCC]], October 05, 2016 » [[Komodo]], [[Match Statistics]], [[Stockfish]]

=External Links=
* [https://en.wikipedia.org/wiki/Promotion_%28chess%29 Promotion (chess) from Wikipedia]
* [https://en.wikipedia.org/wiki/Babson_task Babson task from Wikipedia]
* [https://en.wikipedia.org/wiki/Saavedra_position Saavedra position from Wikipedia]
* [[Videos#JoeHenderson|Joe Henderson Quartet]] - Ya La Quiero, [https://de.wikipedia.org/wiki/Internationale_Jazzwoche_Burghausen Burghausen] 1987, [https://en.wikipedia.org/wiki/YouTube YouTube] Video
: [[Videos#JoeHenderson|Joe Henderson]], [[Videos#KimClarke|Kim Clarke]], [https://en.wikipedia.org/wiki/Renee_Rosnes Renee Rosnes], [http://www.sylviacuenca.com/ Sylvia Cuenca]
: {{#evu:https://www.youtube.com/watch?v=D8O6e5q_m1o|alignment=left|valignment=top}}

=References=
<references />

'''[[Moves|Up one Level]]'''

Navigation menu