Difference between revisions of "Endgame"

From Chessprogramming wiki
Jump to: navigation, search
(Created page with "'''Home * Evaluation * Game Phases * Endgame''' FILE:TanningEndGame.jpg|border|right|thumb|link=https://www.dorotheatanning.org/life-and-work/view/229...")
 
 
(17 intermediate revisions by the same user not shown)
Line 1: Line 1:
 
'''[[Main Page|Home]] * [[Evaluation]] * [[Game Phases]] * Endgame'''
 
'''[[Main Page|Home]] * [[Evaluation]] * [[Game Phases]] * Endgame'''
  
−
[[FILE:TanningEndGame.jpg|border|right|thumb|link=https://www.dorotheatanning.org/life-and-work/view/229/||[[Arts#Tanning|Dorothea Tanning]] - End Game, 1944 <ref>[[Arts#Tanning|Dorothea Tanning]] - End Game, 1944, from [http://www.artnet.com/magazineus/reviews/davis/davis11-1-05.asp artnet Magazine - We Are Duchampians by Ben Davis], [https://www.dorotheatanning.org/life-and-work/view/229/ Endgame | Dorothea Tanning]</ref> ]]  
+
[[FILE:TanningEndGame.jpg|border|right|thumb|link=https://www.dorotheatanning.org/life-and-work/view/229/||[[:Category:Dorothea Tanning|Dorothea Tanning]] - End Game, 1944 <ref>[[:Category:Dorothea Tanning|Dorothea Tanning]] - End Game, 1944, from [http://www.artnet.com/magazineus/reviews/davis/davis11-1-05.asp artnet Magazine - We Are Duchampians by Ben Davis], [https://www.dorotheatanning.org/life-and-work/view/229/ Endgame | Dorothea Tanning]</ref> ]]  
  
 
In the '''Endgame''' chess programs usually have quite a lot of difficulties. Even the most simple endgames often just lead to a mate after 10 to 15 plys or more, which is far beyond the horizon for engines without the specific endgame knowledge. There are some concepts that a chess programmer should implement to overcome the most basic problems. Usually chess engines activate this special Endgame knowledge as soon as the material on board reaches a certain lower-bound.  
 
In the '''Endgame''' chess programs usually have quite a lot of difficulties. Even the most simple endgames often just lead to a mate after 10 to 15 plys or more, which is far beyond the horizon for engines without the specific endgame knowledge. There are some concepts that a chess programmer should implement to overcome the most basic problems. Usually chess engines activate this special Endgame knowledge as soon as the material on board reaches a certain lower-bound.  
Line 21: Line 21:
 
* [[King Centralization]]
 
* [[King Centralization]]
 
* [[King Pawn Tropism]]
 
* [[King Pawn Tropism]]
−
* [[KPK]] database/rules
+
* [[KPK]]
 
* [[Pawn Endgame]]
 
* [[Pawn Endgame]]
 
* [[Rule of the Square]]
 
* [[Rule of the Square]]
  
 
==Pieces==  
 
==Pieces==  
−
* [[Bishops of Same Color]] endgame
+
* [[Bishops of Opposite Colors]]  
−
* [[Bishops of Opposite Colors]] endgame
+
* [[Wrong Color Bishop and Rook Pawn]]
−
* [[Wrong color Bishop and rook pawn]]
 
 
* [[Bishop versus Knight]]
 
* [[Bishop versus Knight]]
−
* Mating in [[KBNK Endgame|KNBK]]
+
* [[KBNK Endgame]]
 
* [[KRK]]
 
* [[KRK]]
 
* [[Rook Endgame]]
 
* [[Rook Endgame]]
 
* [[Queen Endgame]]
 
* [[Queen Endgame]]
 +
* [[Queen versus Pawn]]
  
 
==Endgame Tablebases==  
 
==Endgame Tablebases==  
Line 55: Line 55:
 
* [[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]] » [[Corresponding Squares]]
 
* [[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]] » [[Corresponding Squares]]
 
* [[Ivan Bratko]], [[Tim Niblett]] ('''1979'''). ''Conjectures and Refutations in a Framework for Chess Endgames''. in Expert Systems in the Micro-Electronic Age ([[Donald Michie]], ed.), Edinburgh: Edinburgh University Press, 1979.
 
* [[Ivan Bratko]], [[Tim Niblett]] ('''1979'''). ''Conjectures and Refutations in a Framework for Chess Endgames''. in Expert Systems in the Micro-Electronic Age ([[Donald Michie]], ed.), Edinburgh: Edinburgh University Press, 1979.
−
* [[Ross Quinlan]] ('''1979'''). ''Discovering Rules by Induction from Large Collections of Examples''. Expert Systems in the Micro-electronic Age, pp. 168-201. Edinburgh University Press (Introducing ID3)
 
 
==1980 ...==  
 
==1980 ...==  
 
* [[Danny Kopec]], [[Tim Niblett]] ('''1980'''). ''How Hard is the Play of the King-Rook-King-Knight Ending?'' [[Advances in Computer Chess 2]]
 
* [[Danny Kopec]], [[Tim Niblett]] ('''1980'''). ''How Hard is the Play of the King-Rook-King-Knight Ending?'' [[Advances in Computer Chess 2]]
 
* [[John F. White]] ('''1981'''). ''[http://yourcomputeronline.wordpress.com/2010/12/27/chess-end-game/ Chess-End-Game]''. [[Your Computer]], [http://yourcomputeronline.wordpress.com/2010/12/10/december-1981-%E2%80%93-contents-and-editorial/ December 1981]
 
* [[John F. White]] ('''1981'''). ''[http://yourcomputeronline.wordpress.com/2010/12/27/chess-end-game/ Chess-End-Game]''. [[Your Computer]], [http://yourcomputeronline.wordpress.com/2010/12/10/december-1981-%E2%80%93-contents-and-editorial/ December 1981]
 
* [[Alen Shapiro]], [[Tim Niblett]] ('''1982'''). ''Automatic Induction of Classification Rules for Chess End game.'' [[Advances in Computer Chess 3]]
 
* [[Alen Shapiro]], [[Tim Niblett]] ('''1982'''). ''Automatic Induction of Classification Rules for Chess End game.'' [[Advances in Computer Chess 3]]
−
* [[Ross Quinlan]] ('''1983'''). ''Learning efficient classification procedures and their application to chess end games''. In Machine Learning: An Artificial Intelligence Approach, pages 463–482. Tioga, Palo Alto
+
* [[Ross Quinlan]] ('''1982'''). ''[https://www.researchgate.net/publication/292173657_SEMI-AUTONOMOUS_ACQUISITION_OF_PATTERN-BASED_KNOWLEDGE Semi-Autonomous Acquisition of Pattern-Based Knowledge]''. [https://archive.org/details/introductoryread0000mich Introductory Readings in Expert Systems]
 +
* [[Ross Quinlan]] ('''1983'''). ''[https://link.springer.com/chapter/10.1007/978-3-662-12405-5_15 Learning Efficient Classification Procedures and Their Application to Chess End Games]''. in [https://link.springer.com/book/10.1007%2F978-3-662-12405-5 Machine Learning: An Artificial Intelligence Approach]
 
* [[Denis Verhoef]], [[Jacco H. Wesselius]] ('''1987'''). ''Two-ply KRKN: Safely overtaking Quinlan''. [[ICGA Journal#10_4|ICCA Journal, Vol. 10, No. 4]]
 
* [[Denis Verhoef]], [[Jacco H. Wesselius]] ('''1987'''). ''Two-ply KRKN: Safely overtaking Quinlan''. [[ICGA Journal#10_4|ICCA Journal, Vol. 10, No. 4]]
 
* [[Lars Rasmussen]] ('''1987'''). ''Correcting grandmasters' Analyses in Elementary Endgames''. [[ICGA Journal#10_4|ICCA Journal, Vol. 10, No. 4]]
 
* [[Lars Rasmussen]] ('''1987'''). ''Correcting grandmasters' Analyses in Elementary Endgames''. [[ICGA Journal#10_4|ICCA Journal, Vol. 10, No. 4]]
Line 77: Line 77:
 
* [[Kevin Coplan]] ('''2001'''). ''[http://ilk.uvt.nl/icga/journal/contents/content24-1.htm#SYNTHESIS%20OF%20CHESS Synthesis of Chess and Chess-like Endgames: A Proof of Correctness]''. [[ICGA Journal#24_1|ICCA Journal, Vol. 24, No. 1]]
 
* [[Kevin Coplan]] ('''2001'''). ''[http://ilk.uvt.nl/icga/journal/contents/content24-1.htm#SYNTHESIS%20OF%20CHESS Synthesis of Chess and Chess-like Endgames: A Proof of Correctness]''. [[ICGA Journal#24_1|ICCA Journal, Vol. 24, No. 1]]
 
* [[Kevin Coplan]] ('''2001'''). ''Synthesis of Chess-like Endgames: Towards a Proof of Correctness''. [[Advances in Computer Games 9]]
 
* [[Kevin Coplan]] ('''2001'''). ''Synthesis of Chess-like Endgames: Towards a Proof of Correctness''. [[Advances in Computer Games 9]]
 +
* [[Fabian Mäser]] ('''2002'''). ''Global Threats in Combinatorial Games: A Computation Model with Applications to Chess Endgames''. in [[Richard J. Nowakowski]] (ed) ('''2002'''). ''[http://library.msri.org/books/Book42/ More Games of No Chance]''. [https://en.wikipedia.org/wiki/Cambridge_University_Press Cambridge University Press], [http://library.msri.org/books/Book42/files/maeser.pdf pdf]
 
==2005 ...==
 
==2005 ...==
 
* [[Ami Hauptman]], [[Moshe Sipper]] ('''2005'''). ''GP-EndChess: Using Genetic Programming to Evolve Chess Endgame Players''. [http://www.informatik.uni-trier.de/~ley/db/conf/eurogp/eurogp2005.html#HauptmanS05 EuroGP 2005], [http://www.cs.bgu.ac.il/~sipper/papabs/eurogpchess-final.pdf pdf]
 
* [[Ami Hauptman]], [[Moshe Sipper]] ('''2005'''). ''GP-EndChess: Using Genetic Programming to Evolve Chess Endgame Players''. [http://www.informatik.uni-trier.de/~ley/db/conf/eurogp/eurogp2005.html#HauptmanS05 EuroGP 2005], [http://www.cs.bgu.ac.il/~sipper/papabs/eurogpchess-final.pdf pdf]
−
* [[Omid David]], [[Ariel Felner]], [[Nathan S. Netanyahu]] ('''2006'''). ''Blockage Detection in Pawn Endgames''. [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science LNCS] 3846, [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]
+
* [[Eli David|Omid David]], [[Ariel Felner]], [[Nathan S. Netanyahu]] ('''2006'''). ''Blockage Detection in Pawn Endgames''. [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science LNCS] 3846, [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]
 
* [[Ami Hauptman]], [[Moshe Sipper]] ('''2007'''). ''Emergence of Complex Strategies in the Evolution of Chess Endgame Players''. [http://www.informatik.uni-trier.de/~ley/db/journals/advcs/advcs10.html#HauptmanS07 Advances in Complex Systems 10]
 
* [[Ami Hauptman]], [[Moshe Sipper]] ('''2007'''). ''Emergence of Complex Strategies in the Evolution of Chess Endgame Players''. [http://www.informatik.uni-trier.de/~ley/db/journals/advcs/advcs10.html#HauptmanS07 Advances in Complex Systems 10]
 
* [[John Nunn]] ('''2009'''). ''[http://www.newinchess.com/Understanding_Chess_Endgames-p-1843.html Understanding Chess Endgames]''. [https://en.wikipedia.org/wiki/Gambit_Publications Gambit] <ref>[http://www.chessbase.com/post/nunn-on-understanding-che-endgames Nunn on Understanding Chess Endgames], [[ChessBase|ChessBase News]], September 13, 2009</ref>
 
* [[John Nunn]] ('''2009'''). ''[http://www.newinchess.com/Understanding_Chess_Endgames-p-1843.html Understanding Chess Endgames]''. [https://en.wikipedia.org/wiki/Gambit_Publications Gambit] <ref>[http://www.chessbase.com/post/nunn-on-understanding-che-endgames Nunn on Understanding Chess Endgames], [[ChessBase|ChessBase News]], September 13, 2009</ref>
Line 88: Line 89:
 
* [[Karsten Müller]], [[Guy Haworth]] ('''2013'''). ''Rook vs. Bishop''. [[ICGA Journal#36_4|ICGA Journal, Vol. 36, No. 4]]
 
* [[Karsten Müller]], [[Guy Haworth]] ('''2013'''). ''Rook vs. Bishop''. [[ICGA Journal#36_4|ICGA Journal, Vol. 36, No. 4]]
 
* [[Matej Guid]], [[Martin Možina]], [[Ciril Bohak]], [[Aleksander Sadikov]], [[Ivan Bratko]] ('''2013'''). ''Building an Intelligent Tutoring System for Chess Endgames''. [http://dblp.uni-trier.de/db/conf/csedu/csedu2013.html#GuidMBSB13 CSEDU 2013]
 
* [[Matej Guid]], [[Martin Možina]], [[Ciril Bohak]], [[Aleksander Sadikov]], [[Ivan Bratko]] ('''2013'''). ''Building an Intelligent Tutoring System for Chess Endgames''. [http://dblp.uni-trier.de/db/conf/csedu/csedu2013.html#GuidMBSB13 CSEDU 2013]
 +
* [[Guy Haworth]] ('''2014'''). ''[http://centaur.reading.ac.uk/34268/ Chess Endgame Records (dataset)]''.
 
==2015 ...==
 
==2015 ...==
 
* [[Michael Hartisch]], [[Ingo Althöfer]] ('''2015'''). ''Optimal Robot Play in Certain Chess Endgame Situations''. [[ICGA Journal#38_3|ICGA Journal, Vol. 38, No. 3]]
 
* [[Michael Hartisch]], [[Ingo Althöfer]] ('''2015'''). ''Optimal Robot Play in Certain Chess Endgame Situations''. [[ICGA Journal#38_3|ICGA Journal, Vol. 38, No. 3]]
Line 93: Line 95:
 
* [[Karsten Müller]] ('''2017'''). ''Tablebases, Fermat, Knights and Knightmares''. [[ICGA Journal#39_2|ICGA Journal, Vol. 39, No. 2]]
 
* [[Karsten Müller]] ('''2017'''). ''Tablebases, Fermat, Knights and Knightmares''. [[ICGA Journal#39_2|ICGA Journal, Vol. 39, No. 2]]
 
* [[Guy Haworth]] ('''2017'''). ''Understanding Rook Endgames''. [[ICGA Journal#39_2|ICGA Journal, Vol. 39, No. 2]]
 
* [[Guy Haworth]] ('''2017'''). ''Understanding Rook Endgames''. [[ICGA Journal#39_2|ICGA Journal, Vol. 39, No. 2]]
 +
* [[Karsten Müller]], [[Guy Haworth]] ('''2018'''). ''Chess Endgame News: The World Chess Championship, 2018''. [[ICGA Journal#40_4|ICGA Journal, Vol. 40, No. 4]] <ref>[https://en.wikipedia.org/wiki/World_Chess_Championship_2018 World Chess Championship 2018 from Wikipedia]</ref>
 +
* [[Karsten Müller]], [[Guy Haworth]] ('''2019'''). ''FinalGen revisited: new discoveries''. [[ICGA Journal#41_1|ICGA Journal, Vol. 41, No. 1]] » [[FinalGen]]
 +
* [[Guy Haworth]] ('''2019'''). ''Chess endgame news: Understanding minor piece endgames ''. [[ICGA Journal#41_2|ICGA Journal, Vol. 41, No. 2]]
 +
* [[Guy Haworth]] ('''2019'''). ''Chess endgame news: an endgame challenge for neural nets''. [[ICGA Journal#41_3|ICGA Journal, Vol. 41, No. 3]] » [[Neural Networks]]
 +
==2020 ...==
 +
* [[Guy Haworth]] ('''2020'''). ''CEN: Understanding Rook vs Minor Piece Endgames''. [[ICGA Journal#42_1|ICGA Journal, Vol. 42, No. 1]]
 +
* [https://en.wikipedia.org/wiki/Mark_Dvoretsky Mark Dvoretsky] ('''2020'''). ''[https://www.newinchess.com/dvoretsky-s-endgame-manual-6270 Dvoretsky's Endgame Manual 5th Edition]''. revised by [[Karsten Müller]], [https://en.wikipedia.org/wiki/Hanon_Russell Russell Enterprises]
 +
* [[Guy Haworth]] ('''2021'''). ''Dvoretsky’s Endgame Manual, Edition 5: The bible evolves''. [[ICGA Journal#43_1|ICGA Journal, Vol. 43, No. 1]]
 +
* [[Dave Gomboc]], [[Christian R. Shelton]] ('''2021'''). ''Chess endgame compression via logic minimization''. [[Advances in Computer Games 17]]
  
 
=Forum Posts=  
 
=Forum Posts=  
Line 107: Line 118:
 
* [http://www.talkchess.com/forum/viewtopic.php?t=62153 Define end game] by [[Laurie Tunnicliffe]], [[CCC]], November 16, 2016 » [[Tapered Eval]]
 
* [http://www.talkchess.com/forum/viewtopic.php?t=62153 Define end game] by [[Laurie Tunnicliffe]], [[CCC]], November 16, 2016 » [[Tapered Eval]]
 
* [http://www.talkchess.com/forum/viewtopic.php?t=64356 Testing endgame strength] by [[Álvaro Begué]], [[CCC]], June 21, 2017 » [[Engine Testing]], [[RuyDos]]
 
* [http://www.talkchess.com/forum/viewtopic.php?t=64356 Testing endgame strength] by [[Álvaro Begué]], [[CCC]], June 21, 2017 » [[Engine Testing]], [[RuyDos]]
 +
* [https://groups.google.com/d/msg/fishcooking/znU1a7aZ2XI/yJDFtOQnAwAJ mg vs eg eval] by [[Joost VandeVondele]], [[Computer Chess Forums|FishCooking]], October 06, 2019 » [[Middlegame]], [[Stockfish]]
 +
==2020 ...==
 +
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=73012 Endgame woes] by [[Tom King]], [[CCC]], February 07, 2020 » [[Draw Evaluation]]
 +
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=73713 Allowing null move pruning in the endgame] by Steven Griffin, [[CCC]], April 20, 2020 » [[Null Move Pruning]]
 +
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=76521 Endgame recognition] by [[Niels Abildskov]], [[CCC]], February 07, 2021
  
 
=External Links=  
 
=External Links=  
Line 114: Line 130:
 
=References=  
 
=References=  
 
<references />
 
<references />
−
 
 
'''[[Game Phases|Up one level]]'''
 
'''[[Game Phases|Up one level]]'''
 
[[Category:Dorothea Tanning]]
 
[[Category:Dorothea Tanning]]

Latest revision as of 22:04, 30 November 2021

Home * Evaluation * Game Phases * Endgame

Dorothea Tanning - End Game, 1944 [1]

In the Endgame chess programs usually have quite a lot of difficulties. Even the most simple endgames often just lead to a mate after 10 to 15 plys or more, which is far beyond the horizon for engines without the specific endgame knowledge. There are some concepts that a chess programmer should implement to overcome the most basic problems. Usually chess engines activate this special Endgame knowledge as soon as the material on board reaches a certain lower-bound.

Transposition Tables

Nowhere else are the Transposition Hash Tables more efficient than in Endgames. They are invaluable.

Evaluation

When doing a positional evaluation, in the endgame, the chess engines should change some parameters. So for example in the middlegame, if the opponent's king is trapped in the center, it should be evaluated much better for the program than the opponent's king, safely standing at the border. In the endgame however, its the other way round. A king on the edge or even in the corner has not so many squares to escape to and is more beneficial for the other player. Furthermore, if you only have one bishop, it might be good to evaluate the opponent's king being forced to go to the corner with the color of the bishop a higher bonus, than for the other corner. In addition Pawn promotion is a very important aim in most endgames. The chess engines should consider that by evaluating the strength of passed pawns.

Special Knowledge

Some endgames are extensively covered by theory, and for that reason one can supply a vast number of heuristics for playing them. Typical examples include:

King and Pawns

Pieces

Endgame Tablebases

see main article Endgame Tablebases.

Currently many engines support the usage of Endgame Tablebases, precalculated databases that hold for every possible position in a certain endgame, whether it is drawn or how many moves are left for a side to win/lose assuming perfect play. With the help of those, chess engines can simply lookup, if it is advisable to do a certain exchange or not, as well as how to finish some of the more tricky endgames. The advantage of Endgame Tablebases is the ability to determine the definite outcome of a certain position, but on the other side, Tablebases are very space consuming and the disk-access tends to be slow.

See also

Publications

1960 ...

1970 ...

1980 ...

1990 ...

1995 ...

2000 ...

2005 ...

2010 ...

2015 ...

2020 ...

Forum Posts

2000 ...

2010 ...

2020 ...

External Links

References

  1. ↑ Dorothea Tanning - End Game, 1944, from artnet Magazine - We Are Duchampians by Ben Davis, Endgame | Dorothea Tanning
  2. ↑ Nunn on Understanding Chess Endgames, ChessBase News, September 13, 2009
  3. ↑ Nunn’s Chess Endings Volume One, ChessBase News, May 28, 2010
  4. ↑ World Chess Championship 2018 from Wikipedia

Up one level

Retrieved from "https://www.chessprogramming.org/index.php?title=Endgame&oldid=26055"