25,161
edits
Changes
Created page with "'''Home * Evaluation * Game Phases * Endgame * Pawn Endgame''' FILE:Elke_Rehder_Chess_Schach_Bauern_Koenig_Pawns_King.jpg|border|right|thumb|link=..."
'''[[Main Page|Home]] * [[Evaluation]] * [[Game Phases]] * [[Endgame]] * Pawn Endgame'''
[[FILE:Elke_Rehder_Chess_Schach_Bauern_Koenig_Pawns_King.jpg|border|right|thumb|link=http://www.elke-rehder.de/Chess_Paintings.htm|Pawns threaten the King <ref>[http://www.elke-rehder.de/Chess_Paintings.htm Chess Paintings] by [[Arts#Rehder|Elke Rehder]]</ref> ]]
The '''Pawn Endgame''' is an endgame actually without any [[Pieces|pieces]] but only [[Pawn|pawns]] and [[King|kings]]. Pawn endings somehow remind on a completely different game domain, requiring special evaluation routines, as well as conditions inside the [[Search|search]], i. e. switching of [[Null Move Pruning|null move pruning]]. Specially in "closed" or blocked pawn endgames with [[Pawn Rams (Bitboards)|rammed]] and [[Backward Pawn|backward pawns]] with only very few reasonable moves due to extremely low [[Mobility|mobility]], [[Zugzwang|zugzwang]], [[Stalemate|stalemate]], [[Triangulation|triangulation]], [[Tempo|tempo]] issues, the concepts of [[Opposition|opposition]] or more general [[Corresponding Squares|corresponding squares]], and [[King Pattern#FloodFillAlgorithms|king path puzzles]] start to dominate. Otherwise, in open pawn endings, naturally with a bigger [[Branching Factor|branching factor]] than the closed, all kinds of [[Passed Pawn|passed pawn]] issues are taken into account.
Using the [[Transposition Table|transposition table]] is essential in pawn endings, as demonstrated in positions like the [[Lasker-Reichhelm Position]] (Fine 70) or the [[Réti Endgame Study]] with astonishing [[Depth|search depths]]. Certainly, many programs [[Capture Extensions|extend]] a lot, if the last piece was captured with the transition into an "unclear" pawn endgame. [[Ed Schroder|Ed Schröder]] for instance, extends by three [[Ply|plies]] in [[Rebel]] considering [[Bound|bounds]] <ref>Quote by [[Ed Schroder|Ed Schröder]] from his [http://www.top-5000.nl/authors/rebel/chess840.htm Programmer Corner]: The Search is extended with 3 plies when the search transits to a pawn-ending. An extra window check of 3 pawns is done on I_SCORE before the extension is rewarded</ref> .
=Considerations=
* [[Backward Pawn]]
* [[Blockage Detection]]
* [[Candidate Passed Pawn]]
* [[Capture Extensions]]
* [[Connected Passed Pawns]]
* [[Corresponding Squares]]
* [[Hidden Passed Pawn]]
* [[King Pawn Tropism]]
* [[KPK]] database/rules
* [[Opposition]]
* [[Outside Passed Pawn]]
* [[Pawns Breakthrough]]
* [[Pawn Race]]
* [[Passed Pawn]]
* [[Passed Pawn Extensions]]
* [[Protected Passed Pawn]]
* [[Rule of the Square]]
* [[Stalemate]]
* [[Tempo]]
* [[Triangulation]]
* [[Zugzwang]]
=Pawn Endgame Programs=
* [[Chunker]]
* [[PawnKing]]
* [[Peasant]]
=Pawn Endgame Positions=
* [[Lasker-Reichhelm Position]] (Fine 70)
* [[Réti Endgame Study]]
=See also=
* [[King Pattern#KingAndPawns|King and Pawns]] from [[King Pattern]] in [[Bitboards]]
* [[Null Move Pruning]]
* [[Pawn Hash Table]]
* [[Pawn Pattern and Properties]] in [[Bitboards]]
* [[Pawn Structure]]
* [[Transposition Table]]
=Publications=
==Chess==
* [https://en.wikipedia.org/wiki/Vitaly_Halberstadt Vitali Halberstadt] and [[Arts#Duchamp|Marcel Duchamp]] ('''1932'''). ''L'opposition et les cases conjuguées sont réconciliées''. » [[Corresponding Squares]]
: Paris-Brussels 1932, German Edition 2001 ''[http://www.buecher-nach-isbn.info/3-608/3608500359-Opposition-und-Schwesterfelder-Marcel-Duchamp-Vitali-Halberstadt-3-608-50035-9.html Opposition und Schwesterfelder]'', ISBN 3-932170-35-0
* [https://en.wikipedia.org/wiki/Reuben_Fine Reuben Fine] ('''1941'''). ''[https://en.wikipedia.org/wiki/Basic_Chess_Endings Basic Chess Endings]'', Chapter 2, King and Pawn Endings
* [https://en.wikipedia.org/wiki/Yuri_Averbakh Yuri Averbakh], [http://de.wikipedia.org/wiki/Ilja_Lwowitsch_Maiselis Ilia Maizelis] ('''1987'''). ''Comprehensive Chess Endings Vol 4: Pawn Endings, Cadogan Books 1987''.
* [[Karsten Müller]], [https://en.wikipedia.org/wiki/Frank_Lamprecht Frank Lamprecht] ('''2000'''). ''Secrets of Pawn Endings''. [https://en.wikipedia.org/wiki/Everyman_Chess Everyman Chess], ('''2007'''). [http://dev.jeremysilman.com/shop/pc/Secrets-of-Pawn-Endings-p3748.htm re-issue] by [https://en.wikipedia.org/wiki/Gambit_Publications Gambit Publications]
* [[Eric Schiller]] ('''2006'''). ''Of Kings and Pawns - Chess Strategy in the Endgame'', Universal Publishers, ISBN-13: 978-1581129090, [http://www.amazon.com/Kings-Pawns-Chess-Strategy-Endgame/dp/1581129092 amazon], sample chapter as [http://www.ericschiller.com/pdf/Of%20Kings%20and%20Pawns%20Excerpts.pdf pdf]
==Computer Chess==
==1977 ...==
* [[Monroe Newborn]] ('''1977'''). ''PEASANT: An endgame program for kings and pawns''. [[Chess Skill in Man and Machine]] » [[Peasant]]
* [[Crispin Perdue]], [[Hans Berliner]] ('''1977'''). ''[http://dl.acm.org/citation.cfm?id=1624529 EG: a case study in problem solving with king and pawn endings]''. [http://www.sigmod.org/dblp/db/conf/ijcai/ijcai77.html 5. IJCAI 1977]
* [[Kenneth W. Church]] ('''1978'''). ''[http://dl.acm.org/citation.cfm?id=67030 Co-ordinate Squares: A Solution to Many Chess Pawn Endgames]''. B.Sc. thesis, [[Massachusetts Institute of Technology]], reprinted 1988 in [[Computer Chess Compendium]]
* [[Kenneth W. Church]] ('''1979'''). ''Co-ordinate Squares: A Solution to Many Chess Pawn Endgames''. (abbreviated version of B.Sc. thesis), [[Conferences#IJCAI1979|IJCAI-79]], Tokyo, Japan
* [[Peter W. Frey]], [[Larry Atkin]] ('''1979'''). ''[https://archive.org/stream/byte-magazine-1979-01/1979_01_BYTE_04-01_Life_Algorithms#page/n127/mode/2up Creating a Chess-Player, Part 4: Thoughts on Strategy]''. In [http://cs.millersville.edu/~liffick/ Blaise W. Liffick] (ed.), [http://books.google.com/books/about/The_BYTE_book_of_Pascal.html?id=ofpfQgAACAAJ The Byte Book of Pascal], pp. 143-155. Byte Publications, also [[Byte Magazine#BYTE401|BYTE, Vol. 4, No. 1]] » [[Corresponding Squares]]
==1980 ...==
* [[Helmut Horacek]] ('''1982'''). ''Ein Modell für Schachbauernendspiele mit menschlichen Problemlösungstechniken''. PhD-Thesis, Department of Computer Science, [https://en.wikipedia.org/wiki/University_of_Vienna University of Vienna], Supervisors: [http://www.logic.univie.ac.at/ Prof. Dr. Curt Christian] (University of Vienna) and [[Wilhelm Barth|Prof. Dr. Wilhelm Barth]] ([[Vienna University of Technology]]).
* [[Helmut Horacek]] ('''1982'''). ''Construction of Planned Move Trees for Chess Pawn Endings''. Sigart Newsletter 80, pp. 163-168.
* [[Helmut Horacek]] ('''1983'''). ''Knowledge-Based Move Selection and Evaluation to Guide the Search in Chess Pawn Endings''. [[ICGA Journal#6_3|ICCA Journal, Vol. 6, No. 3]]
* [[Murray Campbell]], [[Hans Berliner]] ('''1983'''). ''A Chess Program That Chunks''. AAAI 1983 49-53, [http://www.aaai.org/Papers/AAAI/1983/AAAI83-012.pdf pdf] » [[Chunker]]
* [[Hans Berliner]], [[Murray Campbell]] ('''1984'''). ''[http://www.sciencedirect.com/science/article/pii/0004370284900067 Using Chunking to Solve Chess Pawn Endgames]''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 23, No. 1, pp. 97-120. ISSN 0004-3702
* [[Andy Walker|Andrew N. Walker]] ('''1989'''). ''Interactive Solution of King and Pawn Endings''. [[Advances in Computer Chess 5]]
==1990 ...==
* [[Wilhelm Barth]] ('''1995'''). ''Combining Knowledge and Search to Yield Infallible Endgame Programs A study of passed Pawns in the KPKP endgame.'' [[ICGA Journal#18_3|ICCA Journal, Vol. 18, No. 3]] <ref>[[Steven Edwards]] ('''1995'''). ''Comments on Barth’s Article “Combining Knowledge and Search to Yield Infallible Endgame Programs.”'' [[ICGA Journal#18_4|ICCA Journal, Vol. 18, No. 4]]</ref>
* [[Wilhelm Barth]] ('''1995'''). ''The KPKP Endgame: An Amplification''. [[ICGA Journal#18_4|ICCA Journal, Vol. 18, No. 4]]
==2000 ...==
* [[Omid David]], [[Ariel Felner]], [[Nathan S. Netanyahu]] ('''2004'''). ''Blockage Detection in Pawn Endgames''. [[ICGA Journal#27_3|ICGA Journal, Vol. 27, No. 3]]
* [[Zvi Retchkiman Königsberg]] ('''2007'''). ''A Combinatorial Game Mathematical Strategy Planning Procedure for a Class of Chess Endgames''. [http://www.m-hikari.com/imf-password2007/65-68-2007/index.html International Mathematical Forum, Vol. 2, No. 68]
==2010 ...==
* [[Monroe Newborn]], [[Robert Hyatt]] ('''2014'''). ''Computer Chess Endgame Play with Pawns: Then and Now''. [[ICGA Journal#37_4|ICGA Journal, Vol. 37, No. 4]] » [[Peasant]], [[Crafty]]
=Forum Posts=
==1997 ...==
* [http://groups.google.com/group/rec.games.chess.computer/browse_frm/thread/49490ca6fbd06b94 Deep analyses of pawn endgames] by [[Dap Hartmann]], [[Computer Chess Forums|rgcc]], February 10, 1997
==2000 ...==
* [https://www.stmintz.com/ccc/index.php?id=92283 Pawn endings [blocked pawns]] by [[José Antônio Fabiano Mendes]], [[CCC]], January 26, 2000
* [https://www.stmintz.com/ccc/index.php?id=131885 Pawn endgame test suite] by [[Peter McKenzie]], [[CCC]], October 07, 2000 » [[Test-Positions]]
* [https://www.stmintz.com/ccc/index.php?id=247236 king and pawns ending] by [[Frank Phillips]], [[CCC]], August 23, 2002
* [http://www.talkchess.com/forum/viewtopic.php?t=14578 Is this rule safe (how has K&Ps vs K&Ps databases? ...)] by [[Mark Lefler]], [[CCC]], June 20, 2007 » [[KPK]], [[Now]]
* [http://www.talkchess.com/forum/viewtopic.php?t=19304 king pawn endgames] by [[Mike Adams]], [[CCC]], January 30, 2008
==2010 ...==
* [http://www.talkchess.com/forum/viewtopic.php?t=37023 Pawns ending] by [[Andres Valverde]], [[CCC]], December 10, 2010
* [http://www.talkchess.com/forum/viewtopic.php?t=40748 Code of Chiron for Detection of Pawn Blockages] by [[Ubaldo Andrea Farina]], [[CCC]], October 13, 2011
* [http://www.talkchess.com/forum/viewtopic.php?t=46183 pawn endgame] by [[Marek Kwiatkowski]], [[CCC]], November 28, 2012
=External Links=
* [https://en.wikipedia.org/wiki/Chess_endgame#King_and_pawn_endings King and pawn endings from Wikipedia]
* [http://chess-training.blogspot.com/2006/11/endgame-lab-king-and-pawn-endings_24.html Chess Training: Endgame Lab - King and Pawn Endings]
* [http://www.leeds-rose-forgrove-chess.org/kingandpawn.html King and Pawn Trickiness] from [http://www.leeds-rose-forgrove-chess.org/index.html Leeds Rose Forgrove Chess Club]
=References=
<references />
'''[[Endgame|Up one Level]]'''
[[Category:Elke Rehder]]
[[FILE:Elke_Rehder_Chess_Schach_Bauern_Koenig_Pawns_King.jpg|border|right|thumb|link=http://www.elke-rehder.de/Chess_Paintings.htm|Pawns threaten the King <ref>[http://www.elke-rehder.de/Chess_Paintings.htm Chess Paintings] by [[Arts#Rehder|Elke Rehder]]</ref> ]]
The '''Pawn Endgame''' is an endgame actually without any [[Pieces|pieces]] but only [[Pawn|pawns]] and [[King|kings]]. Pawn endings somehow remind on a completely different game domain, requiring special evaluation routines, as well as conditions inside the [[Search|search]], i. e. switching of [[Null Move Pruning|null move pruning]]. Specially in "closed" or blocked pawn endgames with [[Pawn Rams (Bitboards)|rammed]] and [[Backward Pawn|backward pawns]] with only very few reasonable moves due to extremely low [[Mobility|mobility]], [[Zugzwang|zugzwang]], [[Stalemate|stalemate]], [[Triangulation|triangulation]], [[Tempo|tempo]] issues, the concepts of [[Opposition|opposition]] or more general [[Corresponding Squares|corresponding squares]], and [[King Pattern#FloodFillAlgorithms|king path puzzles]] start to dominate. Otherwise, in open pawn endings, naturally with a bigger [[Branching Factor|branching factor]] than the closed, all kinds of [[Passed Pawn|passed pawn]] issues are taken into account.
Using the [[Transposition Table|transposition table]] is essential in pawn endings, as demonstrated in positions like the [[Lasker-Reichhelm Position]] (Fine 70) or the [[Réti Endgame Study]] with astonishing [[Depth|search depths]]. Certainly, many programs [[Capture Extensions|extend]] a lot, if the last piece was captured with the transition into an "unclear" pawn endgame. [[Ed Schroder|Ed Schröder]] for instance, extends by three [[Ply|plies]] in [[Rebel]] considering [[Bound|bounds]] <ref>Quote by [[Ed Schroder|Ed Schröder]] from his [http://www.top-5000.nl/authors/rebel/chess840.htm Programmer Corner]: The Search is extended with 3 plies when the search transits to a pawn-ending. An extra window check of 3 pawns is done on I_SCORE before the extension is rewarded</ref> .
=Considerations=
* [[Backward Pawn]]
* [[Blockage Detection]]
* [[Candidate Passed Pawn]]
* [[Capture Extensions]]
* [[Connected Passed Pawns]]
* [[Corresponding Squares]]
* [[Hidden Passed Pawn]]
* [[King Pawn Tropism]]
* [[KPK]] database/rules
* [[Opposition]]
* [[Outside Passed Pawn]]
* [[Pawns Breakthrough]]
* [[Pawn Race]]
* [[Passed Pawn]]
* [[Passed Pawn Extensions]]
* [[Protected Passed Pawn]]
* [[Rule of the Square]]
* [[Stalemate]]
* [[Tempo]]
* [[Triangulation]]
* [[Zugzwang]]
=Pawn Endgame Programs=
* [[Chunker]]
* [[PawnKing]]
* [[Peasant]]
=Pawn Endgame Positions=
* [[Lasker-Reichhelm Position]] (Fine 70)
* [[Réti Endgame Study]]
=See also=
* [[King Pattern#KingAndPawns|King and Pawns]] from [[King Pattern]] in [[Bitboards]]
* [[Null Move Pruning]]
* [[Pawn Hash Table]]
* [[Pawn Pattern and Properties]] in [[Bitboards]]
* [[Pawn Structure]]
* [[Transposition Table]]
=Publications=
==Chess==
* [https://en.wikipedia.org/wiki/Vitaly_Halberstadt Vitali Halberstadt] and [[Arts#Duchamp|Marcel Duchamp]] ('''1932'''). ''L'opposition et les cases conjuguées sont réconciliées''. » [[Corresponding Squares]]
: Paris-Brussels 1932, German Edition 2001 ''[http://www.buecher-nach-isbn.info/3-608/3608500359-Opposition-und-Schwesterfelder-Marcel-Duchamp-Vitali-Halberstadt-3-608-50035-9.html Opposition und Schwesterfelder]'', ISBN 3-932170-35-0
* [https://en.wikipedia.org/wiki/Reuben_Fine Reuben Fine] ('''1941'''). ''[https://en.wikipedia.org/wiki/Basic_Chess_Endings Basic Chess Endings]'', Chapter 2, King and Pawn Endings
* [https://en.wikipedia.org/wiki/Yuri_Averbakh Yuri Averbakh], [http://de.wikipedia.org/wiki/Ilja_Lwowitsch_Maiselis Ilia Maizelis] ('''1987'''). ''Comprehensive Chess Endings Vol 4: Pawn Endings, Cadogan Books 1987''.
* [[Karsten Müller]], [https://en.wikipedia.org/wiki/Frank_Lamprecht Frank Lamprecht] ('''2000'''). ''Secrets of Pawn Endings''. [https://en.wikipedia.org/wiki/Everyman_Chess Everyman Chess], ('''2007'''). [http://dev.jeremysilman.com/shop/pc/Secrets-of-Pawn-Endings-p3748.htm re-issue] by [https://en.wikipedia.org/wiki/Gambit_Publications Gambit Publications]
* [[Eric Schiller]] ('''2006'''). ''Of Kings and Pawns - Chess Strategy in the Endgame'', Universal Publishers, ISBN-13: 978-1581129090, [http://www.amazon.com/Kings-Pawns-Chess-Strategy-Endgame/dp/1581129092 amazon], sample chapter as [http://www.ericschiller.com/pdf/Of%20Kings%20and%20Pawns%20Excerpts.pdf pdf]
==Computer Chess==
==1977 ...==
* [[Monroe Newborn]] ('''1977'''). ''PEASANT: An endgame program for kings and pawns''. [[Chess Skill in Man and Machine]] » [[Peasant]]
* [[Crispin Perdue]], [[Hans Berliner]] ('''1977'''). ''[http://dl.acm.org/citation.cfm?id=1624529 EG: a case study in problem solving with king and pawn endings]''. [http://www.sigmod.org/dblp/db/conf/ijcai/ijcai77.html 5. IJCAI 1977]
* [[Kenneth W. Church]] ('''1978'''). ''[http://dl.acm.org/citation.cfm?id=67030 Co-ordinate Squares: A Solution to Many Chess Pawn Endgames]''. B.Sc. thesis, [[Massachusetts Institute of Technology]], reprinted 1988 in [[Computer Chess Compendium]]
* [[Kenneth W. Church]] ('''1979'''). ''Co-ordinate Squares: A Solution to Many Chess Pawn Endgames''. (abbreviated version of B.Sc. thesis), [[Conferences#IJCAI1979|IJCAI-79]], Tokyo, Japan
* [[Peter W. Frey]], [[Larry Atkin]] ('''1979'''). ''[https://archive.org/stream/byte-magazine-1979-01/1979_01_BYTE_04-01_Life_Algorithms#page/n127/mode/2up Creating a Chess-Player, Part 4: Thoughts on Strategy]''. In [http://cs.millersville.edu/~liffick/ Blaise W. Liffick] (ed.), [http://books.google.com/books/about/The_BYTE_book_of_Pascal.html?id=ofpfQgAACAAJ The Byte Book of Pascal], pp. 143-155. Byte Publications, also [[Byte Magazine#BYTE401|BYTE, Vol. 4, No. 1]] » [[Corresponding Squares]]
==1980 ...==
* [[Helmut Horacek]] ('''1982'''). ''Ein Modell für Schachbauernendspiele mit menschlichen Problemlösungstechniken''. PhD-Thesis, Department of Computer Science, [https://en.wikipedia.org/wiki/University_of_Vienna University of Vienna], Supervisors: [http://www.logic.univie.ac.at/ Prof. Dr. Curt Christian] (University of Vienna) and [[Wilhelm Barth|Prof. Dr. Wilhelm Barth]] ([[Vienna University of Technology]]).
* [[Helmut Horacek]] ('''1982'''). ''Construction of Planned Move Trees for Chess Pawn Endings''. Sigart Newsletter 80, pp. 163-168.
* [[Helmut Horacek]] ('''1983'''). ''Knowledge-Based Move Selection and Evaluation to Guide the Search in Chess Pawn Endings''. [[ICGA Journal#6_3|ICCA Journal, Vol. 6, No. 3]]
* [[Murray Campbell]], [[Hans Berliner]] ('''1983'''). ''A Chess Program That Chunks''. AAAI 1983 49-53, [http://www.aaai.org/Papers/AAAI/1983/AAAI83-012.pdf pdf] » [[Chunker]]
* [[Hans Berliner]], [[Murray Campbell]] ('''1984'''). ''[http://www.sciencedirect.com/science/article/pii/0004370284900067 Using Chunking to Solve Chess Pawn Endgames]''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 23, No. 1, pp. 97-120. ISSN 0004-3702
* [[Andy Walker|Andrew N. Walker]] ('''1989'''). ''Interactive Solution of King and Pawn Endings''. [[Advances in Computer Chess 5]]
==1990 ...==
* [[Wilhelm Barth]] ('''1995'''). ''Combining Knowledge and Search to Yield Infallible Endgame Programs A study of passed Pawns in the KPKP endgame.'' [[ICGA Journal#18_3|ICCA Journal, Vol. 18, No. 3]] <ref>[[Steven Edwards]] ('''1995'''). ''Comments on Barth’s Article “Combining Knowledge and Search to Yield Infallible Endgame Programs.”'' [[ICGA Journal#18_4|ICCA Journal, Vol. 18, No. 4]]</ref>
* [[Wilhelm Barth]] ('''1995'''). ''The KPKP Endgame: An Amplification''. [[ICGA Journal#18_4|ICCA Journal, Vol. 18, No. 4]]
==2000 ...==
* [[Omid David]], [[Ariel Felner]], [[Nathan S. Netanyahu]] ('''2004'''). ''Blockage Detection in Pawn Endgames''. [[ICGA Journal#27_3|ICGA Journal, Vol. 27, No. 3]]
* [[Zvi Retchkiman Königsberg]] ('''2007'''). ''A Combinatorial Game Mathematical Strategy Planning Procedure for a Class of Chess Endgames''. [http://www.m-hikari.com/imf-password2007/65-68-2007/index.html International Mathematical Forum, Vol. 2, No. 68]
==2010 ...==
* [[Monroe Newborn]], [[Robert Hyatt]] ('''2014'''). ''Computer Chess Endgame Play with Pawns: Then and Now''. [[ICGA Journal#37_4|ICGA Journal, Vol. 37, No. 4]] » [[Peasant]], [[Crafty]]
=Forum Posts=
==1997 ...==
* [http://groups.google.com/group/rec.games.chess.computer/browse_frm/thread/49490ca6fbd06b94 Deep analyses of pawn endgames] by [[Dap Hartmann]], [[Computer Chess Forums|rgcc]], February 10, 1997
==2000 ...==
* [https://www.stmintz.com/ccc/index.php?id=92283 Pawn endings [blocked pawns]] by [[José Antônio Fabiano Mendes]], [[CCC]], January 26, 2000
* [https://www.stmintz.com/ccc/index.php?id=131885 Pawn endgame test suite] by [[Peter McKenzie]], [[CCC]], October 07, 2000 » [[Test-Positions]]
* [https://www.stmintz.com/ccc/index.php?id=247236 king and pawns ending] by [[Frank Phillips]], [[CCC]], August 23, 2002
* [http://www.talkchess.com/forum/viewtopic.php?t=14578 Is this rule safe (how has K&Ps vs K&Ps databases? ...)] by [[Mark Lefler]], [[CCC]], June 20, 2007 » [[KPK]], [[Now]]
* [http://www.talkchess.com/forum/viewtopic.php?t=19304 king pawn endgames] by [[Mike Adams]], [[CCC]], January 30, 2008
==2010 ...==
* [http://www.talkchess.com/forum/viewtopic.php?t=37023 Pawns ending] by [[Andres Valverde]], [[CCC]], December 10, 2010
* [http://www.talkchess.com/forum/viewtopic.php?t=40748 Code of Chiron for Detection of Pawn Blockages] by [[Ubaldo Andrea Farina]], [[CCC]], October 13, 2011
* [http://www.talkchess.com/forum/viewtopic.php?t=46183 pawn endgame] by [[Marek Kwiatkowski]], [[CCC]], November 28, 2012
=External Links=
* [https://en.wikipedia.org/wiki/Chess_endgame#King_and_pawn_endings King and pawn endings from Wikipedia]
* [http://chess-training.blogspot.com/2006/11/endgame-lab-king-and-pawn-endings_24.html Chess Training: Endgame Lab - King and Pawn Endings]
* [http://www.leeds-rose-forgrove-chess.org/kingandpawn.html King and Pawn Trickiness] from [http://www.leeds-rose-forgrove-chess.org/index.html Leeds Rose Forgrove Chess Club]
=References=
<references />
'''[[Endgame|Up one Level]]'''
[[Category:Elke Rehder]]
