25,161
edits
Changes
Created page with "'''Home * Knowledge * Endgame Tablebases''' FILE:SamuaelBakPersistence.jpg|border|right|thumb|link=http://chgs.elevator.umn.edu/asset/viewAsset/57f3b6787d..."
'''[[Main Page|Home]] * [[Knowledge]] * Endgame Tablebases'''
[[FILE:SamuaelBakPersistence.jpg|border|right|thumb|link=http://chgs.elevator.umn.edu/asset/viewAsset/57f3b6787d58ae5f74bf8ba9#57f3b6d77d58ae5574bf8bd8|[[Arts#Bak|Samuel Bak]] - Persistence <ref>[http://chgs.elevator.umn.edu/asset/viewAsset/57f3b6787d58ae5f74bf8ba9#57f3b6d77d58ae5574bf8bd8 Chess in the Art of Samuel Bak], [http://www.chgs.umn.edu/ Center for Holocaust & Genocide Studies], [https://en.wikipedia.org/wiki/University_of_Minnesota University of Minnesota]</ref> ]]
'''Endgame Tablebases''', (EGTBs or EGTs)<br/>
precalculated [[Endgame|endgame]] [https://en.wikipedia.org/wiki/Table_%28database%29 tables] generated by an exhaustive [[Retrograde Analysis|retrograde analysis]]. During its [[Chess Game|game play]] and/or [[Search|search]], [[Interior Node Recognizer|recognizing]] a specific [[Material|material composition]], a chess program can probe, or in principle compute these tables to determine the outcome of positions definitively and act as an [[Oracle|oracle]] providing the optimal moves. The tables are usually divided into separate [https://en.wikipedia.org/wiki/Computer_file files] for each material configuration and [[Side to move|side to move]]. What all different [[Endgame Tablebases#Formats|formats]] of tablebases have in common is that every possible piece placement has its own, unique index number which represents the position where the information about the position is located in the file. Positions with non-null castling rights could be represented in an EGT but typically are not.
The term '''Tablebase''' opposed to endgame database was coined by [[Steven Edwards]] by means of a data vector and a single file access for both sides to move, when he introduced his [[Edwards' Tablebases]], addressing several shortcomings of [[Ken Thompson|Ken Thompson's]] earlier [[Thompson's Databases|database]] of positions with the weaker and hence potentially losing side to move only <ref>[[Ernst A. Heinz]] ('''1999'''). ''Endgame Databases and Efficient Index Schemes for Chess.'' [[ICGA Journal#22_1|ICCA Journal, Vol. 22, No. 1]], [http://people.csail.mit.edu/heinz/ps/edb_index.ps.gz ps]</ref> .
=Metrics=
==DTM<span id="DTM"></span>==
'''Depth to Mate'''
'Mate' is the ultimate goal and ends the game. For each position that is represented, 'DTM' indicates the theoretical value, and the number of winner's moves to 'Mate' if won/lost - assuming that the winner is minimizing and the loser is maximizing DTM.
==DTC<span id="DTC"></span>==
'''Depth to Conversion'''
'Conversion' is the changing of the force on the board, by capture and/or Pawn-conversion. For each position that is represented, 'DTC' indicates the theoretical value, and the number of winner's moves to the goal of 'Won Conversion' if won/lost - assuming that the winner is minimizing and the loser is maximizing DTC. DTC <span style="font-family: Symbol;">£ </span>DTM.
==DTZ<span id="DTZ"></span>==
'''Depth to Zeroing (of the ply count)'''
The ply-count is zeroed if and only if a Pawn is pushed or a capture is made. For each position that is represented, 'DTZ' indicates the theoretical value, and the number of winner's moves to the goal of 'Win and ply-count zeroed' if won/lost - assuming that the winner is minimizing and the loser is maximizing DTZ. DTZ <span style="font-family: Symbol;">£ </span>DTC <span style="font-family: Symbol;">£ </span>DTM.
==DTZ50<span id="DTZ50"></span>==
'''Depth to Zeroing (of the ply count) in the context of the ''50-Move'' ''Rule'''''
The DTC, DTM and DTZ metrics do not consider the current FIDE [[Fifty-move Rule|50-move rule]] whereby a game in which no [[Irreversible Moves|irreversible moves]] have been played for 100 plies can be claimed as a draw by the player 'on move'. In this metric, in addition to the DTC/DTM/DTZ ''draws'', positions requiring more than 50 winner's moves to zero the ply-count are defined as ''draws''. DTZ <span style="font-family: Symbol;">£ </span>DTZ50 if DTZ50 <span style="font-family: Symbol; font-size: 14.66px;">¹ </span>''draw.'' 'DTZ50' is one of a set of 'DTZk' rules: a ''k''-''move rule'' effectively applies if there are only ''k'' moves left before a draw-claim might be made. ''k1'' <span style="font-family: Symbol;">£ </span>''k2'' implies ''DTZk2'' <span style="font-family: Symbol;">£ </span>''DTZk1 if DTZk1'' <span style="font-family: Symbol; font-size: 14.66px;">¹ </span>draw.
Note that, because depth is measured in winner's moves rather than plies, this metric does '''not''' define as ''draw'' a position in which 50 winner's moves and 51 loser's moves are required to zero the ply-count, despite the fact that the loser would claim a draw after 100 plies had been played in that endgame.
==DTR<span id="DTR"></span>==
'''Depth by the (''k''-move) Rule'''
'The Rule' referred to here is a notional set of ''k''-move rules. For each position that is represented, 'DTR' indicates the theoretical value and, for won/lost positions'','' the least ''k'' for which DTZ''k'' is not ''draw'' - assuming that the winner is minimising and the loser is maximising DTR. DTZ <span style="font-family: Symbol;">£ </span>DTR. No DTR EGTs have been created to date <ref>[http://kirill-kryukov.com/chess/discussion-board/viewtopic.php?f=6&t=3934 DTR is no good!] by [[Harm Geert Muller]], [[Computer Chess Forums|CCRL Forum]], September 24, 2008</ref> .
==DTZR<span id="DTZR"></span>==
'''Depth to Zeroing move, give that DTR is being minimaxed'''
If DTR = ''draw'', then DTZR = ''draw''. Otherwise, Otherwise DTRZR indicates the theoretical value, and the number of winner's moves to the zeroing of the ply count, given that the two sides are minimaxing first DTR and then DTZR. DTZR would be used in conjunction with DTR to progress a deep win in the context of a ''k''-move rule because DTR can remain unchanged over a sequence of moves. DTZR <span style="font-family: Symbol;">£ </span>DTR but it is not always the case that DTZ <span style="font-family: Symbol;">£ </span>DTZR as may seem intuitively obvious: the loser may zero the move-count to maximise DTR.
==Summary==
To summarize the different metrics of tablebases, each metric has its strengths and weaknesses. [[Nalimov Tablebases|Nalimov's DTM EGTs]] are widely and commercially available, and used by many chess engines or chess GUIs. DTC EGTs are more easily computed and stored as they involve smaller depth-ranges and are more compressible. For endgames with less or equal than 5 pieces on the board, KNNKP comes closest to requiring more than one [[Byte]] per position to store DTM: maxDTM = 115 (1-0) and 73 (0-1) necessitating 190 values in the EGT. For KPPKP, maxDTM = 127 (1-0) but only 42 (0-1). But for certain 6 piece endgames, one Byte is not enough: maxDTM = 262 for a KRNKNN position. The DTC and DTZ metrics increasingly postpone the need for two Bytes per position in an uncompressed EGT, but KRBNKQN has maxDTC = maxDTZ = 517 (0-1), both wtm and btm.
In extremis, he unmoderated use of DTM, DTC or DTZ EGTs will let slip a winnable position in the context of the 50-move rule ... hence the marginal need for the DTR and DTZR metrics, coupled with the ability to recompute DTR/DTZR EGTs in the context of a limited move-budget.
<span id="Bitbases"></span>
=Bitbases=
''see main article [[Endgame Bitbases]]''
Inside the [[Search|search]] much denser tables with value {''won'', ''draw'', ''loss'', ''invalid''} or boolean {''win'', ''not_win''} information are sufficient with respect to [[Bound|bounds]]. Denser tables are more efficiently used, given that [[Memory|memory]] and cache are limited resources. Boolean ''Win/Not_Win'' Bitbases require only one bit per position (and if necessary, further enquiry if ''draw'' is to be distinguished from ''loss'' with respect to [[Bound|bounds]]). ''Value'' Bitbases require two bits per position.
=Indexing=
Every position is assigned to an unique index to specify the location of the information stored about it. There are two main aims when generating the index number. The easier the algorithm to generate the index from any given position, the faster will be the probing of the tablebase as well as the generation of it. But the second aim is to get a relatively small range of index-numbers, to keep the size of the file as small as possible.
The most straight forward way would be to for every piece on the board use 6 bit (1-64 squares)
<pre>
index = position_white_King + position_black_King * 64
for each piece {
index = index * 64 + position
}
</pre>
This can be optimized in several ways.
A chess board can be rotated and mirrored (if pawns are on the board only a vertical reflection is possible).
* Pieces may not stand on the same square.
* For pieces of the same type, different arrangements can be left away.
* The side to move may not give check.
* The distance between the two Kings must be greater than one.
=Brief Info=
of some popular Endgame tablebases:
{| class="wikitable"
|-
! Format
! Metric
! 1st published
! 5 men
! 6 men
! 7 men
|-
| [[Thompson's Databases|Thompson]]
| style="text-align:center;" | [[Endgame Tablebases#DTC|DTC]]
| style="text-align:center;" | 1991
| 2.5 [https://en.wikipedia.org/wiki/Gibibyte GiB] (not completed)
| style="text-align:center;" | -
| style="text-align:center;" | -
|-
| [[Edwards' Tablebases|Edwards]]
| style="text-align:center;" | [[Endgame Tablebases#DTM|DTM]]
| style="text-align:center;" | 1994
| 56 GiB (estimated)
| style="text-align:center;" | -
| style="text-align:center;" | -
|-
| [[Nalimov Tablebases|Nalimov]]
| style="text-align:center;" | DTM
| style="text-align:center;" | 1998
| 7.1 GiB
| style="text-align:center;" | 1.2 [https://en.wikipedia.org/wiki/Tebibyte TiB]
| style="text-align:center;" | -
|-
| [[Scorpio Bitbases|Scorpio]]
| style="text-align:center;" | [[Endgame Tablebases#Bitbases|WDL]]
| style="text-align:center;" | 2005
| 214 [https://en.wikipedia.org/wiki/Mebibyte MiB]
| style="text-align:center;" | 48.1 GiB
| style="text-align:center;" | -
|-
| [[Gaviota Tablebases|Gaviota]]
| style="text-align:center;" | DTM
| style="text-align:center;" | 2008
| 6.5 GiB
| style="text-align:center;" | -
| style="text-align:center;" | -
|-
| [[Lomonosov Tablebases|Lomonosov]]
| style="text-align:center;" | DTM
| style="text-align:center;" | 2012
| style="text-align:center;" | -
| style="text-align:center;" | -
| style="text-align:center;" | 140 TiB
|-
| [[Syzygy Bases|Syzygy]]
| style="text-align:center;" | WDL + [[Endgame Tablebases#DTZ50|DTZ50]]
| style="text-align:center;" | 2013
| 939 MiB
| style="text-align:center;" | 150.2 GiB
| style="text-align:center;" | -
|}
<span id="Formats"></span>
=Formats=
* [[Chenard#EGDB|Chenard's EGDB]]
* [[Edwards' Tablebases]]
* [[Gaviota Tablebases]]
* [[Lomonosov Tablebases]]
* [[Nalimov Tablebases]]
* [[RetroChess]]
* [[Scorpio Bitbases]]
* [[Syzygy Bases]]
* [[Thompson's Databases]]
=Generators=
* [[FinalGen]]
* [[Freezer]]
* [[GAFS]]
<span id="7-men"></span>
=7-man EGTBs=
==2005==
In 2005, [[Yakov Konoval]] started to collaborate with [[Marc Bourzutschky]] on constructing 7-man EGTBs. Yakov wrote the generator and Marc a verification program and some utilities for extracting the data. In October 2005, Yakov Konoval and Marc Bourzutschky announced that a position in the ending of a KRRNkrr requires 290 moves to convert to a simpler winning endgame <ref>[https://www.stmintz.com/ccc/index.php?id=456178 Subject: KRRNKRR win in 290: a new record] by [[Marc Bourzutschky]] from [[CCC]], October 16, 2005</ref> . The old record was 243 moves from a position in a rook and knight versus two knights endgame, discovered by [[Lewis Stiller]] in 1991 <ref>[https://en.wikipedia.org/wiki/Chess_endgame Chess endgame from Wikipedia]</ref> .
==2006==
In March 2006, the wizards of 7-men endgames, Marc Bourzutschky and Yakov Konoval found a 330 moves win in KQBNkqb <ref>[http://www.xs4all.nl/~timkr/chess2/diary_16.htm 311. 31 March 2006: White plays and wins in 330 moves] by [https://en.wikipedia.org/wiki/Tim_Krabb%C3%A9 Tim Krabbé]</ref> and in May 2006 a 517 moves win in KQNkrbn <ref>[http://www.xs4all.nl/~timkr/chess2/diary_16.htm OPEN CHESS DIARY 316. 26 May 2006: A 517-move win] by [https://en.wikipedia.org/wiki/Tim_Krabb%C3%A9 Tim Krabbé]</ref> .
==2012==
In July 2012, [[Vladimir Makhnychev]] and [[Victor Zakharov]] from [[Moscow State University]] completed 4+3 DTM-tablebases (525 endings including KPPPKPP). The next set of 5+2 DTM-tablebases was completed during August 2012 <ref>[https://en.wikipedia.org/wiki/Endgame_tablebase#Background Endgame tablebase from Wikipedia - Background]</ref> . The tablebases are named [[Lomonosov Tablebases]], using the [[Lomonosov Supercomputer]].
==2013==
[[ChessOK|Convekta Ltd.]] announced the release of [[Lomonosov Tablebases]]. Until December 31, 2013, the tablebases will be available online through [[ChessOk]] [[ChessOk#Products|products]] <ref>[http://chessok.com/?page_id=27966 Lomonosov Endgame Tablebases] - [[ChessOK]]</ref> .
=See also=
* [[Retrograde Analysis]]
* [[Endgame]]
* [[Interior Node Recognizer]]
* [[KPK]]
* [[Oracle]]
=Selected Publications=
==1965 ...==
* [[Richard E. Bellman]] ('''1965'''). ''[http://www.rand.org/pubs/papers/P3013/ On the application of dynamic programming to the determination of optimal play in chess and checkers].'' Proceedings of the National Academy of Sciences of the United States of America. [http://www.ncbi.nlm.nih.gov/pmc/articles/PMC219499/pdf/pnas00154-0020.pdf pdf]
==1970 ...==
* [[Thomas Ströhlein]] ('''1970'''). ''Untersuchungen über kombinatorische Spiele.'' Ph.D. Thesis, [[Technical University of Munich]] (German)
* [[Edward Komissarchik]], [[Aaron L. Futer]] ('''1974'''). ''Ob Analize Ferzevogo Endshpilya pri Pomoshchi EVM.'' (Analysis of a queen endgame using an IBM computer) Problemy Kybernetiki, Vol. 29, pp. 211-220. English translation by [[Christian Posthoff|C. Posthoff]], revised in [[ICGA Journal#9_4|ICCA Journal, Vol. 9, No. 4]] ('''1986''')
==1975 ...==
* [http://www.mathnet.ru/php/person.phtml?option_lang=eng&personid=55935 A. G. Alexandrov], [http://www.mathnet.ru/php/person.phtml?option_lang=eng&personid=96113 A. M. Baraev], [http://www.mathnet.ru/php/person.phtml?option_lang=eng&personid=96114 Ya. Yu. Gol'fand], [[Edward Komissarchik]], [[Aaron L. Futer]] ('''1977'''). ''[http://www.mathnet.ru/php/archive.phtml?wshow=paper&jrnid=at&paperid=7425&option_lang=eng Computer analysis of rook end game]''. [https://en.wikipedia.org/wiki/Automation_and_Remote_Control Avtomatika i Telemekhanika], No. 8, 113–117
* [http://www.mathnet.ru/php/person.phtml?option_lang=eng&personid=55935 A. G. Alexandrov], [[Vladimir Arlazarov]], [http://www.mathnet.ru/php/person.phtml?option_lang=eng&personid=96113 A. M. Baraev], [http://www.mathnet.ru/php/person.phtml?option_lang=eng&personid=96114 Ya. Yu. Gol'fand], [https://zbmath.org/authors/?q=ai:deza.v-n V. N. Deza], [https://zbmath.org/authors/?q=ai:ilina.t-p T. P. Il’ina], [[Edward Komissarchik]], [[Anatoly Uskov]], [https://zbmath.org/authors/?q=ai:faradzhev.i-a I. A. Faradzhev], [[Aaron L. Futer]] ('''1977'''). ''[https://zbmath.org/?q=an:03653550 Processing of large files of information on the example of the analysis of the rook’s end game]''. [http://www.springer.com/computer/journal/11086 Programming and Computer Software], No. 3
* [[Thomas Ströhlein]], [[Ludwig Zagler]] ('''1977'''). ''[http://www.sciencedirect.com/science/article/pii/0012365X77900334 Analyzing games by Boolean matrix iteration]''. [https://en.wikipedia.org/wiki/Discrete_Mathematics_%28journal%29 Discrete Mathematics], Vol. 19, No. 2
* [[Thomas Ströhlein]], [[Ludwig Zagler]] ('''1978'''). ''Ergebnisse einer vollstandigen Analyse von Schachendspielen: König und Turm gegen König, König und Turm gegen König und Laufer.'' Report, Institut für Informatik, [[Technical University of Munich]] (German)
* [[Max Bramer]] ('''1978'''). ''Computer-Generated Databases for the Endgame in Chess.'' Technical Report. [https://en.wikipedia.org/wiki/Milton_Keynes Milton Keynes], [https://en.wikipedia.org/wiki/Open_University Open University] Faculty of Mathematics.
* [[Aaron L. Futer]] ('''1978'''). ''[https://zbmath.org/?q=an:03637634 Programming endgames with few pieces]''. [https://en.wikipedia.org/wiki/Doklady_Physics Soviet Physics. Doklady], No. 23
* [[Vladimir Arlazarov]], [[Aaron L. Futer]] ('''1979'''). ''Computer Analysis of a Rook End-Game''. [http://www.doc.ic.ac.uk/~shm/MI/mi9.html Machine Intelligence 9] (eds. [[Jean Hayes Michie]], [[Donald Michie]] and L.I. Mikulich), pp. 361-371. Ellis Horwood, Chichester. Reprinted in [[Computer Chess Compendium]]
==1985 ...==
* [[Jaap van den Herik]], [[Bob Herschberg]] ('''1985'''). ''The Construction of an Omniscient Endgame Data Base''. [[ICGA Journal#8_2|ICCA Journal, Vol. 8, No. 2]]
* [[John Roycroft]] ('''1985'''). ''Chess-Endgame Data-Base`Oracles': Necessary and Desirable Features''. [[ICGA Journal#8_2|ICCA Journal, Vol. 8, No. 2]]
* [[Harry Nefkens]] ('''1985'''). ''Constructing Data Bases to Fit a Microcomputer''. [[ICGA Journal#8_4|ICCA Journal, Vol. 8, No. 4]]
'''1986'''
* [[Jaap van den Herik]], [[Bob Herschberg]] ('''1986'''). ''A Data Base on Data Bases''. [[ICGA Journal#9_1|ICCA Journal, Vol. 9, No. 1]]
* [[John Roycroft]], [[Ken Thompson]] ('''1986'''). ''Queen and Pawn on a2 against Queen''. Chess Endgame Consultants and Publishers, London
* [[John Roycroft]], [[Ken Thompson]] ('''1986'''). ''Queen and Pawn on a6 against Queen''. Chess Endgame Consultants and Publishers, London
* [[John Roycroft]], [[Ken Thompson]] ('''1986'''). ''Queen and Pawn on b7 against Queen''. Chess Endgame Consultants and Publishers, London
* [[Jaap van den Herik]] ('''1986'''). ''Roycroft's 5-Man Chess Endgame Series''. [[ICGA Journal#9_3|ICCA Journal, Vol. 9, No. 3]]
* [[Ken Thompson]] ('''1986'''). ''Retrograde Analysis of Certain Endgames''. [[ICGA Journal#9_3|ICCA Journal, Vol. 9, No. 3]], [http://pdos.csail.mit.edu/~rsc/thompson86endgame.pdf pdf]
* [[Edward Komissarchik]], [[Aaron L. Futer]] ('''1986'''). ''Computer Analysis of a Queen Endgame''. [[ICGA Journal#9_4|ICCA Journal, Vol. 9, No. 4]] <ref>[http://www.mathematik.uni-bielefeld.de/%7Esillke/NEWS/brute-force Subject: brute-force vs. intuition in math & chess] by [https://en.wikipedia.org/wiki/Macsyma Bill Dubuque], August 1996</ref>
* [[Ken Thompson]] ('''1986'''). ''An Example of QPvQ''. [[ICGA Journal#9_4|ICCA Journal, Vol. 9, No. 4]]
* [[Hans Zellner]] ('''1986'''). ''Compressing Databases Down to Micro Size''. [[ICGA Journal#9_4|ICCA Journal, Vol. 9, No. 4]]
'''1987'''
* [[Hans Zellner]] ('''1987'''). ''KBBK Squeezed into a Micro''. [[ICGA Journal#10_1|ICCA Journal, Vol. 10, No. 1]]
* [[Jaap van den Herik]], [[Bob Herschberg]] ('''1987'''). ''The KBBKN Statistics: New Data from Ken Thompson''. [[ICGA Journal#10_1|ICCA Journal, Vol. 10, No. 1]]
* [[Bob Herschberg]], [[Jaap van den Herik]] ('''1987'''). ''More Truth on KBBK Database Results''. [[ICGA Journal#10_2|ICCA Journal, Vol. 10, No. 2]]
* [[Hans Zellner]], [[Jaap van den Herik]], [[Bob Herschberg]] ('''1987'''). ''Corrections and Substantiations to KBNK''. [[ICGA Journal#10_3|ICCA Journal, Vol. 10, No. 3]]
* [[Sito Dekker]], [[Jaap van den Herik]], [[Bob Herschberg]] ('''1987'''). ''Complexity Starts at Five.'' [[ICGA Journal#10_3|ICCA Journal, Vol. 10, No. 3]]
* [[Lars Rasmussen]] ('''1987'''). ''Correcting grandmasters' Analyses in Elementary Endgames''. [[ICGA Journal#10_4|ICCA Journal, Vol. 10, No. 4]]
* [[Jaap van den Herik]], [[Bob Herschberg]], [[Najib Nakad]] ('''1987'''). ''A Six-Men-Endgame Database: KRP(a2)KbBP(a3)''. [[ICGA Journal#10_4|ICCA Journal, Vol. 10, No. 4]], [http://arno.uvt.nl/show.cgi?fid=106791 pdf]
* [[Sito Dekker]], [[Jaap van den Herik]], [[Bob Herschberg]] ('''1987'''). ''Perfect Knowledge and Beyond''. Report 37-87, [[Delft University of Technology]], Delft.
* [[John Roycroft]] ('''1987'''). ''Expert Against Oracle''. [http://www.doc.ic.ac.uk/~shm/MI/mi11.html Machine Intelligence 11]
'''1988'''
* [[Jaap van den Herik]], [[Bob Herschberg]] ('''1988'''). ''Computer Checks on Human Analyses of the KRKB Endgame''. [[ICGA Journal#11_1|ICCA Journal, Vol. 11, No. 1]]
* [[Lars Rasmussen]] ('''1988'''). ''Ultimates in KQKR and KRKN''. [[ICGA Journal#11_1|ICCA Journal, Vol. 11, No. 1]]
* [[Lewis Stiller]] ('''1988'''). ''Massively Parallel Retrograde Endgame Analysis''. BUCS Tech. Report #88-014, Boston University, Computer Science Department.
* [[Jaap van den Herik]], [[Bob Herschberg]], [[Najib Nakad]] ('''1988'''). ''A Reply to R. Sattler's Remarks on the KRP(a2)KbBP(a3) Database''. [[ICGA Journal#11_23|ICCA Journal, Vol. 11, No. 2/3]], [http://arno.uvt.nl/show.cgi?fid=106798 pdf]
* [[Lars Rasmussen]] ('''1988'''). ''A Database for KRKP''. [[ICGA Journal#11_4|ICCA Journal, Vol. 11, No. 4]]
'''1989'''
* [[Christopher A. Marris]] ('''1989'''). ''Compressing a Chess-Endgame Database''. [[ICGA Journal#12_1|ICCA Journal, Vol. 12, No. 1]]
* [[David Forthoffer]], [[Lars Rasmussen]], [[Sito Dekker]] ('''1989'''). ''A Correction to some KRKB-Database Results''. [[ICGA Journal#12_1|ICCA Journal, Vol. 12, No. 1]]
* [https://en.wikipedia.org/wiki/Edmar_Mednis Edmar Mednis] ('''1989'''). ''Rook and Bishop versus Rook: The Controversial Endgame''. [[ICGA Journal#12_1|ICCA Journal, Vol. 12, No. 1]]
* [[Lewis Stiller]] ('''1989'''). ''Parallel Analysis of Certain Endgames''. [[ICGA Journal#12_2|ICCA Journal, Vol. 12, No. 2]]
* [[Hans Zellner]] ('''1989'''). ''The KPK Database Revisited''. [[ICGA Journal#12_2|ICCA Journal, Vol. 12, No. 2]]
* [[Sito Dekker]], [[Jaap van den Herik]], [[Bob Herschberg]] ('''1989'''). ''Perfect Knowledge and Beyond''. [[Advances in Computer Chess 5]]
* [[Bob Herschberg]], [[Jaap van den Herik]], [[Patrick Schoo]] ('''1989'''). ''Verifying and Codifying Strategies in the KNNKP(h) Endgame''. [[ICGA Journal#12_3|ICCA Journal, Vol. 12, No. 3]], [http://arno.uvt.nl/show.cgi?fid=106804 pdf]
* [[Hans Zellner]] ('''1989'''). ''KBBKN on a Micro''. [[ICGA Journal#12_3|ICCA Journal, Vol. 12, No. 3]]
* [[John Roycroft]] ('''1989'''). ''The Computer is at it again - Interfering with the Endgame!'' [https://en.wikipedia.org/wiki/British_Chess_Magazine Britisch Chess Magazine], Vol. 109, No. 10
==1990 ...==
* [[Bob Herschberg]], [[Jaap van den Herik]], [[Patrick Schoo]] ('''1990'''). ''Verifying and Codifying Strategies in a Chess Endgame''. [[Computers, Chess, and Cognition]], pp. 183-196
* [[John Roycroft]] ('''1990'''). ''How to Treat Endgame Databases.'' [[ICGA Journal#13_2|ICCA Journal, Vol. 13, No. 2]]
* [[Ken Thompson]] ('''1990'''). ''KQPKQ and KRPKR Endings''. [[ICGA Journal#13_4|ICCA Journal, Vol. 13, No. 4]]
* [[John Roycroft]] ('''1990'''). ''Identifying Three Types of Zugzwang''. [[ICGA Journal#13_4|ICCA Journal, Vol. 13, No. 4]] » [[Zugzwang]]
'''1991'''
* [[Ken Thompson]] ('''1991'''). ''Chess Endgames Vol. 1.'' [[ICGA Journal#14_1|ICCA Journal, Vol. 14, No. 1]]
* [[Ken Thompson]] ('''1991'''). ''New Results for KNPKB and KNPKN Endgames''. [[ICGA Journal#14_1|ICCA Journal, Vol. 14, No. 1]]
* [https://en.wikipedia.org/wiki/Edmar_Mednis Edmar Mednis] ('''1991'''). ''Database Results for KQKRN and KQKRB annotated''. [[ICGA Journal#14_2|ICCA Journal, Vol. 14, No. 2]]
* [[John Roycroft]] ('''1991'''). ''A Postscript to the Computer's Involvement''. [https://en.wikipedia.org/wiki/British_Chess_Magazine Britisch Chess Magazine], Vol. 111, No. 2
* [[Lewis Stiller]] ('''1991'''). ''Some Results from a Massively Parallel Retrograde Analysis.'' [[ICGA Journal#14_3|ICCA Journal, Vol. 14, No. 3]]
* [[John Roycroft]] ('''1991'''). ''A Side-Effect of new Database Knowledge''. [[ICGA Journal#14_3|ICCA Journal, Vol. 14, No. 3]]
* [[John Roycroft]] ('''1991'''). ''A Use for Endgame Databases?'' [[ICGA Journal#14_4|ICCA Journal, Vol. 14, No. 4]]
* [[John Roycroft]], [[Don Beal]] ('''1991'''). ''To Make Dumb Endgame Databases Speak''. [[Advances in Computer Chess 6]]
'''1992'''
* [[Lewis Stiller]] ('''1992'''). ''KQNKRR''. [[ICGA Journal#15_1|ICCA Journal, Vol. 15, No. 1]]
* [[John Nunn]] ('''1992'''). ''Perfect Prose''. [[ICGA Journal#15_2|ICCA Journal, Vol. 15, No. 2]]
* [[Lars Rasmussen]] ('''1992'''). ''Queen versus Rook and Pawn''. [[ICGA Journal#15_2|ICCA Journal, Vol. 15, No. 2]]
'''1993'''
* [[Burton Wendroff]], [[Tony Warnock]], [[Lewis Stiller]], [[Dean Mayer]], [[Ralph Brickner]] ('''1993'''). ''Bits and pieces: constructing chess endgame databases on parallel and vector architectures''. Appl. Num. Math. 12, pp. 285-295, [http://math.unm.edu/%7Ebbw/endgame.ps.gz zipped ps]
* [[Christian Posthoff]], [[Michael Schlosser]], [[Jens Zeidler]] ('''1993'''). ''Search vs. Knowledge? - Search and Knowledge!'' In: Proc. 3rd KADS Meeting, Munich, March 8-9 1993, Siemens AG, Corporate Research and Development, 305-326, 1993.
* [[John Nunn]] ('''1993'''). ''Extracting Information from Endgame Databases''. [[ICGA Journal#16_4|ICCA Journal, Vol. 16, No. 4]]
'''1994'''
* [[Ingo Althöfer]], [[Bernhard Walter]] ('''1994'''). ''Weak Zugzwang: Statistics on some Chess Endgames''. [[ICGA Journal#17_2|ICCA Journal, Vol. 17, No. 2]]
* [[John Nunn]] ('''1994'''). ''More, and More Perfect Prose''. [[ICGA Journal#17_2|ICCA Journal, Vol. 17, No. 2]]
* [[John Nunn]] ('''1994'''). ''Extracting Information from Endgame Databases''. [[Advances in Computer Chess 7]]
* [[Christian Posthoff]], [[Michael Schlosser]], [[Rainer Staudte]], [[Jens Zeidler]] ('''1994'''). ''Transformations of Knowledge''. [[Advances in Computer Chess 7]]
* [[Grit Lachmann]] ('''1994'''). ''Verarbeitung von Wissen aus Endspieldatenbanken''. Master's thesis, [[Chemnitz University of Technology]] (German)
==1995 ...==
* [[Steven Edwards]] and the Editorial Board ('''1995'''). ''An Examination of the Endgame KBNKN''. [[ICGA Journal#18_3|ICCA Journal, Vol. 18, No. 3]]
* [[Henri Bal]], [[Victor Allis]] ('''1995'''). ''Parallel Retrograde Analysis on a Distributed System''. Supercomputing ’95, San Diego, CA.
'''1996'''
* [[Dietmar Lippold]] ('''1996'''). ''Legality of Positions of Simple Chess Endgames''. [http://digilander.libero.it/gargamellachess/papers/legality%20of%20positions.zip zipped pdf] <ref>[[Jesper Torp Kristensen]] ('''2005'''). ''[http://jespertk.dk/Jesper/public/master_thesis/ Generation and compression of endgame tables in chess with fast random access using OBDDs]''. Master thesis</ref>
* [[Ken Thompson]] ('''1996'''). ''6-Piece Endgames''. [[ICGA Journal#19_4|ICCA Journal, Vol. 19, No. 4]]
* [[Lewis Stiller]] ('''1996'''). ''Multilinear Algebra and Chess Endgames''. [http://library.msri.org/books/Book29/index.html Games of No Chance] edited by [[Richard J. Nowakowski]], [http://www.msri.org/publications/books/Book29/files/stiller.pdf pdf]
'''1997'''
* [[Dietmar Lippold]] ('''1997'''). ''The Legitimacy of Positions in Endgame Databases''. [[ICGA Journal#20_1|ICCA Journal, Vol. 20, No. 1]]
* [[Ken Thompson]] ('''1997'''). ''6-Piece Endgames''. [[Advances in Computer Chess 8]]
* [[Johannes Fürnkranz]] ('''1997'''). ''Knowledge Discovery in Chess Databases: A Research Proposal.'' Technical Report OEFAI-TR-97-33, Austrian Research Institute for Artificial Intelligence, [http://www.ke.informatik.tu-darmstadt.de/%7Ejuffi/publications/chess-ws.ps.gz zipped ps], [http://www.top-5000.nl/ps/Knowledge%20discovery%20in%20chess%20databases%20-%20a%20research%20proposal.pdf pdf] <ref>[https://en.wikipedia.org/wiki/Knowledge_discovery Knowledge discovery from Wikipedia]</ref>
'''1999'''
* [[Ernst A. Heinz]] ('''1999'''). ''Endgame Databases and Efficient Index Schemes for Chess.'' [[ICGA Journal#22_1|ICCA Journal, Vol. 22, No. 1]], [http://people.csail.mit.edu/heinz/ps/edb_index.ps.gz ps]
* [[Ernst A. Heinz]] ('''1999'''). ''Knowledgeable Encoding and Querying of Endgame Databases.'' [[ICGA Journal#22_2|ICCA Journal, Vol. 22, No. 2]], [http://people.csail.mit.edu/heinz/ps/know_edb.ps.gz ps]
* [[Christoph Wirth]], [[Jürg Nievergelt]] ('''1999'''). ''Exhaustive and Heuristic Retrograde Analysis of the KPPKP Endgame.'' [[ICGA Journal#22_2|ICCA Journal, Vol. 22, No. 2]]
* [[Eugene Nalimov]], [[Christoph Wirth]], [[Guy Haworth]] ('''1999'''). ''[http://centaur.reading.ac.uk/4564/ KQQKQQ and the Kasparov-World Game]''. [[ICGA Journal#22_4|ICCA Journal, Vol. 22, No. 4]]
* [[Ulrich Thiemonds]] ('''1999'''). ''Ein regelbasiertes Spielprogramm für Schachendspiele''. [https://en.wikipedia.org/wiki/University_of_Bonn University of Bonn], Diploma thesis, [http://www.iai.uni-bonn.de/~idb/diplomarbeiten/thiemonds99.ps.gz zipped ps] (German)
* [[Chrilly Donninger]] ('''1999'''). ''Der Fortschritt ist nicht aufzuhalten - Chrilly Donninger über Endspieldatenbanken''. [[Computerschach und Spiele|CSS]] 6/99, [http://www.mustrum.de/chrilly/tbs.pdf pdf] (German)
==2000 ...==
* [[Haw-ren Fang]], [[Tsan-sheng Hsu]], [[Shun-Chin Hsu]] ('''2000'''). ''[http://link.springer.com/chapter/10.1007/3-540-45579-5_7 Construction of Chinese Chess Endgame Databases by Retrograde Analysis]''. [[CG 2000]]
* [[Ken Thompson]] ('''2000'''). ''The Longest: KRNKNN in 262''. [[ICGA Journal#23_1|ICGA Journal, Vol. 23, No. 1]]
* [[Peter Karrer]] ('''2000'''). ''KQQKQP and KQPKQP≈''.[[ICGA Journal#23_2|ICGA Journal, Vol. 23, No. 2]] <ref>[https://en.wikipedia.org/wiki/Kasparov_versus_the_World Kasparov versus the World from Wikipedia]</ref>
* [[Guy Haworth]] ('''2000'''). ''Chess Endgames: Currents and Futures''. [[5th Computer Olympiad#Workshop|5th Computer Olympiad Workshop]]
* [[Thomas Lincke]], [[Ambros Marzetta]] ('''2000'''). ''Large Endgame Databases with Limited Memory Space''. [[5th Computer Olympiad#Workshop|5th Computer Olympiad Workshop]]
* [[Thomas Lincke]], [[Ambros Marzetta]] ('''2000'''). ''Large Endgame Databases with Limited Memory Space''. [[ICGA Journal#23_3|ICGA Journal, Vol. 23, No. 3]]
* [[Eugene Nalimov]], [[Guy Haworth]], [[Ernst A. Heinz]] ('''2000'''). ''[http://centaur.reading.ac.uk/4562/ Space-Efficient Indexing of Chess Endgame Tables]''. [[ICGA Journal#23_3|ICGA Journal, Vol. 23, No. 3]], [http://supertech.lcs.mit.edu/%7Eheinz/ps/NHH_ICGA.ps.gz postscript]
'''2001'''
* [[John Tamplin]], [[Guy Haworth]] ('''2001'''). ''[http://centaur.reading.ac.uk/4561/ Ken Thompson's 6-man Tables]''. [[ICGA Journal#24_2|ICGA Journal, Vol. 24, No. 2]]
* [[Harold van der Heijden]] ('''2001'''). ''[http://ilk.uvt.nl/icga/journal/contents/content24-2.htm#ENDGAME%20TABLES Endgame Tables and Endgame Study Composition]''. [[ICGA Journal#24_2|ICGA Journal, Vol. 24, No. 2]]
* [[Noam Elkies]] ('''2001'''). ''Endgame Tables and Chess Composition''. [[ICGA Journal#24_2|ICGA Journal, Vol. 24, No. 2]]
* [[Ren Wu]], [[Don Beal]] ('''2001'''). ''Fast, Memory-efficient Retrograde Algorithms''. [[ICGA Journal#24_3|ICGA Journal, Vol. 24, No. 3]] <ref>[https://www.stmintz.com/ccc/index.php?id=200335 Generating egtbs ICGAJ] by [[Tony van Roon-Werten|Tony Werten]], [[CCC]], December 04, 2001, with reference to [http://www.abc.se/~m10051/eg.txt Computing endgames with few men] by [[Urban Koistinen]]</ref> <ref>[http://www.open-aurec.com/wbforum/viewtopic.php?f=4&t=6302&p=29956 Wu / Beal retrograde analisys algorithm] by [[Alvaro Cardoso|Alvaro Jose Povoa Cardoso]], [[Computer Chess Forums|Winboard Forum]], March 10, 2007</ref>
* [[Ren Wu]], [[Don Beal]] ('''2001'''). ''Parallel Retrograde Analysis on Different Architectures''. IEEE 10th Conference in High Performance Distributed Computing pp. 356-362, August 2001
* [[Eugene Nalimov]], [[Guy Haworth]], [[Ernst A. Heinz]] ('''2001'''). ''[http://centaur.reading.ac.uk/4563/ Space-efficient Indexing of Endgame Tables for Chess]''. [[Advances in Computer Games 9]]
* [[Guy Haworth]] ('''2001'''). ''Four Notes on Chess Endgames''. [[6th Computer Olympiad#Workshop|6th Computer Olympiad Workshop]], [https://ilk.uvt.nl/icga/news/Olympiad/Olympiad/workshop/Haworth.ppt ppt]
: [[Guy Haworth]] ('''2001'''). ''Discarding Like Pieces''. [[6th Computer Olympiad#Workshop|6th Computer Olympiad Workshop]]
: [[Guy Haworth]] ('''2001'''). ''Depth by The Rule''. [[6th Computer Olympiad#Workshop|6th Computer Olympiad Workshop]]
: [[Guy Haworth]] ('''2001'''). ''[http://centaur.reading.ac.uk/5949/ 3-5-Man Chess Data]''. [[6th Computer Olympiad#Workshop|6th Computer Olympiad Workshop]]
: [[Guy Haworth]] ('''2001'''). ''[http://centaur.reading.ac.uk/5950/ 3-5-Man Mutual Zugzwangs in Chess]''. [[6th Computer Olympiad#Workshop|6th Computer Olympiad Workshop]]
* [[Guy Haworth]] ('''2001'''). ''[http://centaur.reading.ac.uk/4594/ Discarding Like Pieces]''. [[ICGA Journal#24_3|ICGA Journal, Vol. 24, No. 3]]
* [[Guy Haworth]] ('''2001'''). ''[http://centaur.reading.ac.uk/4593/ Depth by The Rule]''. [[ICGA Journal#24_3|ICGA Journal, Vol. 24, No. 3]]
* [[Guy Haworth]], [[Peter Karrer]], [[John Tamplin]], [[Christoph Wirth]] ('''2001'''). ''[http://centaur.reading.ac.uk/4581/ 3-5-man chess: Maximals and mzugs]''. [[ICGA Journal#24_4|ICGA Journal, Vol. 24, No. 4]]
'''2002'''
* [[Guy Haworth]] ('''2002'''). ''[http://centaur.reading.ac.uk/4552/ Secrets of Pawnless Endings]''. [[ICGA Journal#25_2|ICGA Journal, Vol. 25, No. 2]]
* [[Eugène Nalimov]] ('''2002'''). ''Chess Endgame Tablebases''. Invited Lecture, [[7th Computer Olympiad#Workshop|7th Computer Olympiad Workshop]]
* [[Guy Haworth]] ('''2002'''). ''Reference Fallible Endgame Play''. [[7th Computer Olympiad#Workshop|7th Computer Olympiad Workshop]], [http://centaur.reading.ac.uk/4579/1/2002c_CoW7_H_Reference_Fallible_Endgame_Play.pdf pdf]
* [[Ren Wu]], [[Don Beal]] ('''2002'''). ''A memory efficient retrograde algorithm and its application to solve Chinese Chess endgames.'' [http://library.msri.org/books/Book42/ More Games of No Chance] edited by [[Richard J. Nowakowski]]
'''2003'''
* [[John Tamplin]], [[Guy Haworth]] ('''2003'''). ''[http://centaur.reading.ac.uk/4547/ Chess Endgames: Data and Strategy]''. [[Advances in Computer Games 10]]
* [[Guy Haworth]], [[Rafael B. Andrist]] ('''2003'''). ''[http://centaur.reading.ac.uk/4548/ Model Endgame Analysis]''. [[Advances in Computer Games 10]]
* [[Jonathan Schaeffer]], [[Yngvi Björnsson]], [[Neil Burch]], [[Rob Lake]], [[Paul Lu]], [[Steve Sutphen]] ('''2003'''). ''Building the Checkers 10-Piece Endgame Databases.'' [[Advances in Computer Games 10]]. [http://webdocs.cs.ualberta.ca/%7Ejonathan/Grad/Papers/databases10.pdf pdf] » [[Checkers]]
* [[Guy Haworth]] ('''2003'''). ''[http://centaur.reading.ac.uk/4550/ Reference Fallible Endgame Play]''. [[ICGA Journal#26_2|ICGA Journal, Vol. 26, No. 2]]
* [[Ed Trice]], [[Gil Dodgen]] ('''2003'''). ''[http://ilk.uvt.nl/icga/journal/contents/content26-4.htm#7%20piece The Perfect 7-Piece Checkers Database]''. [[ICGA Journal#26_4|ICGA Journal, Vol. 26, No. 4]] » [[Checkers]]
'''2004'''
* [[Haw-ren Fang]] ('''2004'''). ''[http://link.springer.com/chapter/10.1007/11674399_9 Rule-Tolerant Verification Algorithms for Completeness of Chinese-Chess Endgame Databases]''. [[CG 2004]]
* [[Eiko Bleicher]] ('''2004'''). ''Building Chess Endgame Databases for Positions with many Pieces using A-priori Information''. Lehrstuhl Mathematische Optimierung, [http://www.minet.uni-jena.de/ Fakultät für Mathematik und Informatik], [https://en.wikipedia.org/wiki/University_of_Jena Friedrich-Schiller-Universität, Jena], Germany, as [http://www.minet.uni-jena.de/preprints/bleicher_04/FREEZER_.PDF pdf]
==2005 ...==
* [[Joe Leslie-Hurd|Joe Hurd]] ('''2005'''). ''Formal Verification of Chess Endgame Databases''. in [[Joe Leslie-Hurd|Joe Hurd]], Edward Smith, [http://www.informatik.uni-trier.de/~ley/pers/hd/d/Darbari:Ashish Ashish Darbari] ''Theorem proving in higher order logics: Emerging trends proceedings''. Technical Report PRG-RR-05-02, [http://de.wikipedia.org/wiki/University_of_Oxford Oxford University] Computing Laboratory, [http://www.gilith.com/research/papers/chess.pdf pdf]
* [[Jesper Torp Kristensen]] ('''2005'''). ''[http://jespertk.dk/Jesper/public/master_thesis/ Generation and compression of endgame tables in chess with fast random access using OBDDs]''. Master thesis, Supervisor [[Mathematician#Miltersen|Peter Bro Miltersen]], [https://en.wikipedia.org/wiki/Aarhus_University Aarhus University], [http://jespertk.dk/Jesper/public/master_thesis/report/report.pdf pdf] <ref>[https://en.wikipedia.org/wiki/Binary_decision_diagram OBDD - Ordered Binary Decision Diagram from Wikipedia]</ref>
* [[Guy Haworth]] ('''2005'''). ''[http://centaur.reading.ac.uk/4522/ 6-Man Chess Solved]''. [[ICGA Journal#28_3|ICGA Journal, Vol. 28, No. 3]]
* [[Marc Bourzutschky]], [[John Tamplin]], [[Guy Haworth]] ('''2005'''). ''[http://centaur.reading.ac.uk/4524/ Chess endgames: 6-man data and strategy]''. Theoretical Computer Science, Vol. 349, No. 2
* [[Rafael B. Andrist]], [[Guy Haworth]] ('''2005'''). ''[http://centaur.reading.ac.uk/4523/ Deeper model endgame analysis]''. Theoretical Computer Science, Vol. 349, No. 2
* [[Guy Haworth]] ('''2005'''). ''[http://centaur.reading.ac.uk/4610/ Chess Endgame News]''. [[ICGA Journal#28_4|ICGA Journal, Vol. 28, No. 4]]
* [[Yngvi Björnsson]], [[Jonathan Schaeffer]], [[Nathan Sturtevant]] ('''2005'''). ''[http://link.springer.com/chapter/10.1007/11922155_2 Partial Information Endgame Databases]''. [[Advances in Computer Games 11]], [http://webdocs.cs.ualberta.ca/~nathanst/papers/partialEndgameDatabases.pdf pdf], [http://www.ru.is/faculty/yngvi/pdf/BjornssonSS06.pdf pdf]
'''2006'''
* [[Guy Haworth]] ('''2006'''). ''[http://centaur.reading.ac.uk/4609/ Chess Endgame News]''. [[ICGA Journal#29_1|ICGA Journal, Vol. 29, No. 1]]
* [[Guy Haworth]] ('''2006'''). ''[http://centaur.reading.ac.uk/4608/ Chess Endgame News]''. [[ICGA Journal#29_2|ICGA Journal, Vol. 29, No. 2]]
* [[Guy Haworth]] ('''2006'''). ''[http://centaur.reading.ac.uk/4520/ Chess Endgame News]''. [[ICGA Journal#29_3|ICGA Journal, Vol. 29, No. 3]]
'''2008'''
* [[Bo-Nian Chen]], [[Pangfeng Liu]], [[Shun-Chin Hsu]], [[Tsan-sheng Hsu]] ('''2008'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-87608-3_17 Knowledge Inferencing on Chinese Chess Endgames]''. [[CG 2008]]
'''2009'''
* [[Guy Haworth]] ('''2009'''). ''[http://centaur.reading.ac.uk/5763/ Chess Endgame Update]''. [[ICGA Journal#32_4|ICGA Journal, Vol. 32, No. 4]]
==2010 ...==
* [[Bo-Nian Chen]], [[Pangfeng Liu]], [[Shun-Chin Hsu]], [[Tsan-sheng Hsu]] ('''2010'''). ''Conflict Resolution of Chinese Chess Endgame Knowledge Base''. [[Advances in Computer Games 12]], [http://ticc.uvt.nl/icga/acg12/proceedings/Contribution108.pdf pdf]
* [[Joe Leslie-Hurd|Joe Hurd]], [[Guy Haworth]] ('''2010'''). ''[http://link.springer.com/chapter/10.1007%2F978-3-642-12993-3_20 Data Assurance in Opaque Computations]''. [[Advances in Computer Games 12]], [http://www.gilith.com/research/papers/egt.pdf pdf]
* [[Matej Guid]], [[Martin Možina]], [[Aleksander Sadikov]], [[Ivan Bratko]] ('''2010'''). ''[http://www.springerlink.com/content/um0l155681087p7h Deriving Concepts and Strategies from Chess Tablebases]''. [[Advances in Computer Games 12]], [http://www.ailab.si/matej/doc/Deriving_Concepts_and_Strategies_from_Chess_Tablebases.pdf pdf]
* [[Eiko Bleicher]], [[Guy Haworth]] ('''2010'''). ''[http://centaur.reading.ac.uk/4518/ 6-Man Chess and Zugzwangs]''. [[Advances in Computer Games 12]]
* [[Bo-Nian Chen]], [[Pangfeng Liu]], [[Shun-Chin Hsu]], [[Tsan-sheng Hsu]] ('''2010'''). ''[http://www.springerlink.com/content/6374711454584j73/ Knowledge Abstraction in Chinese Chess Endgame Databases]''. [[CG 2010]]
* [[Ping-hsun Wu]], [[Ping-yi Liu]], [[Tsan-sheng Hsu]] ('''2010'''). ''An External-memory Retrograde Analysis Algorithm'', slides as [http://www.iis.sinica.edu.tw/~tshsu/tcg2010/slides/slide12.pdf pdf]
* [[Eiko Bleicher]], [[Guy Haworth]], [[Harold van der Heijden]] ('''2010'''). ''[http://centaur.reading.ac.uk/17497/ Data-Mining Chess Databases]''. [[ICGA Journal#33_4|ICGA Journal, Vol. 33, No. 4]]
'''2011'''
* [[Guy Haworth]] ('''2011'''). ''Chess Endgame News''. [[ICGA Journal#34_2|ICGA Journal, Vol. 34, No. 2]]
'''2013'''
* [[Guy Haworth]] ('''2013'''). ''Chess Endgame News''. [[ICGA Journal#36_1|ICGA Journal, Vol. 36, No. 1]]
* [[Guy Haworth]] ('''2013'''). ''Chess Endgame News''. [[ICGA Journal#36_2|ICGA Journal, Vol. 36, No. 2]]
* [[Abdallah Saffidine]], [[Nicolas Jouandeau]], [[Cédric Buron]], [[Tristan Cazenave]] ('''2013'''). ''Material Symmetry to Partition Endgame Tables''. [[CG 2013]]
* [[John Nunn]] ('''2013'''). ''Discoveries in R+2P vs. R+P Endings''. [[ICGA Journal#36_3|ICGA Journal, Vol. 36, No. 3]]
* [[Guy Haworth]] ('''2013'''). ''Chess Endgame News''. [[ICGA Journal#36_3|ICGA Journal, Vol. 36, No. 3]]
* [[Karsten Müller]], [[Guy Haworth]] ('''2013'''). ''Rook vs. Bishop''. [[ICGA Journal#36_4|ICGA Journal, Vol. 36, No. 4]]
* [[Bo-Nian Chen]], [[Hung-Jui Chang]], [[Shun-Chin Hsu]], [[Jr-Chang Chen]], [[Tsan-sheng Hsu]] ('''2013'''). ''Multilevel Inference in Chinese Chess Endgame Knowledge Bases''. [[ICGA Journal#36_4|ICGA Journal, Vol. 36, No. 4]] » [[Chinese Chess]]
* [[Guy Haworth]] ('''2013'''). ''Chess Endgame News''. [[ICGA Journal#36_4|ICGA Journal, Vol. 36, No. 4]]
* [[Guy Haworth]] ('''2013'''). ''Haworth’s Law''. [[ICGA Journal#36_4|ICGA Journal, Vol. 36, No. 4]]
* [[Victor Zakharov]], [[Vladimir Makhnychev]] ('''2013'''). ''Creating tables of chess 7-piece endgames on the Lomonosov supercomputer''. Superkomp’yutery, No. 15
'''2014'''
* [[Bo-Nian Chen]], [[Hung-Jui Chang]], [[Shun-Chin Hsu]], [[Jr-Chang Chen]], [[Tsan-sheng Hsu]] ('''2014'''). ''Advanced Meta-knowledge for Chinese Chess Endgame Knowledge Bases''. [[ICGA Journal#37_1|ICGA Journal, Vol 37, No. 1]] » [[Chinese Chess]]
* [[Guy Haworth]] ('''2014'''). ''Chess Endgame News''. [[ICGA Journal#37_1|ICGA Journal, Vol. 37, No. 1]] » [[Syzygy Bases]]
* [[Guy Haworth]] ('''2014'''). ''Chess Endgame News''. [[ICGA Journal#37_2|ICGA Journal, Vol. 37, No. 2]] » [[Syzygy Bases]]
* [[Guy Haworth]] ('''2014'''). ''Chess Endgame News''. [[ICGA Journal#37_3|ICGA Journal, Vol. 37, No. 3]] » [[Syzygy Bases]]
==2015 ...==
* [[Nikolaos Papahristou]], [[Ioannis Refanidis]] ('''2015'''). ''Constructing Pin Endgame Databases for the Backgammon Variant Plakoto''. [[Advances in Computer Games 14]] <ref>[https://en.wikipedia.org/wiki/Plakoto Plakoto from Wikipedia]</ref>
* [[Guy Haworth]] ('''2015'''). ''Chess Endgame News''. [[ICGA Journal#38_1|ICGA Journal, Vol. 38, No. 1]] » [[Crafty]], [[FinalGen]]
* [[Galen Huntington]], [[Guy Haworth]] ('''2015'''). ''Depth to Mate and the 50-Move Rule''. [[ICGA Journal#38_2|ICGA Journal, Vol. 38, No. 2]] » [[Fifty-move Rule|Fifty-Move Rule]] <ref>[http://galen.metapath.org/egtb50/ Endgame tablebases with the fifty-move rule] by [[Galen Huntington]]</ref>
* [[Michael Hartisch]], [[Ingo Althöfer]] ('''2015'''). ''Optimal Robot Play in Certain Chess Endgame Situations''. [[ICGA Journal#38_3|ICGA Journal, Vol. 38, No. 3]]
'''2016'''
* [[Victor Zakharov]], [[Michael G. Malkovsky]], [[Vladislav Y. Shchukin]] ('''2016'''). ''[http://link.springer.com/article/10.3103%2FS0278641916010076 Compression of underdetermined data in a 7-piece chess table]''. [http://www.springer.com/mathematics/journal/11968 Moscow University Computational Mathematics and Cybernetics], Vol. 40, No. 1 <ref>[http://www.talkchess.com/forum/viewtopic.php?t=60222 tablebase compression / academic integrity] by [[Ronald de Man]], [[CCC]], May 19, 2016</ref>
'''2017'''
* [[Karsten Müller]] ('''2017'''). ''Tablebases, Fermat, Knights and Knightmares''. [[ICGA Journal#39_2|ICGA Journal, Vol. 39, No. 2]]
* [[Guy Haworth]] ('''2017'''). ''Chess Endgame News''. [[ICGA Journal#39_2|ICGA Journal, Vol. 39, No. 2]]
=Forum Posts=
==1995 ...==
* [https://groups.google.com/d/msg/rec.games.chess/DBNZkyTtSUQ/PVd9C3UGXpwJ endgame databases and Kasparov] by [[Feng-Hsiung Hsu]], [[Computer Chess Forums|rgc]], April 25, 1995
* [http://groups.google.com/group/rec.games.chess.computer/browse_frm/thread/39b9eb099ae1a5e9 Tablebases and castling?] by [[Ronald de Man]], [[Computer Chess Forums|rgcc]], May 12, 1997
* [https://www.stmintz.com/ccc/index.php?id=11493 Steve Edward's Endgame Tablebase generator is now available for WIN95] by [[Michael Byrne|Mike Byrne]], [[CCC]], November 01, 1997
* [https://groups.google.com/d/msg/rec.games.chess.computer/X7QO1spJ4SE/pLsSj0nlFAoJ Questions about Endgame tablebases] by Alexander Nitschke, [[Computer Chess Forums|rgcc]], March 19, 1998
* [https://www.stmintz.com/ccc/index.php?id=25540 Tablebases] by [[Eugene Nalimov]], [[CCC]], August 28, 1998 » [[Nalimov Tablebases]]
* [https://www.stmintz.com/ccc/index.php?id=25755 Ideas to reduce size of tablebases] by [[Rémi Coulom]], [[CCC]], August 31, 1998
* [http://groups.google.com/group/rec.games.chess.computer/browse_frm/thread/88d16e7b3ad524f1 endgame databases] by [[Robert Hyatt]], [[Computer Chess Forums|rgcc]], October 13, 1998
* [https://www.stmintz.com/ccc/index.php?id=42184 Interesting endgame database probe problem] by [[Robert Hyatt]], [[CCC]], February 04, 1999
: [https://www.stmintz.com/ccc/index.php?id=42763 overlapping tablebase lookup] by [[Jay Scott]], [[CCC]], February 09, 1999
==2000 ...==
* [https://www.stmintz.com/ccc/index.php?id=107902 Tablebase Access Code] by [[Roberto Waldteufel]], [[CCC]], April 26, 2000 » [[Rabbit]]
* [https://www.stmintz.com/ccc/index.php?id=162252 EGTB: Better algorithm] by [[Urban Koistinen]], [[CCC]], April 07, 2001 <ref>[http://www.abc.se/~m10051/eg.txt Computing endgames with few men] by [[Urban Koistinen]]</ref>
* [http://groups.google.com/group/rec.games.chess.computer/msg/392bcd5797808c0e Re: How endgame tablebases work] by [[Bruce Moreland]], [[Computer Chess Forums|rgcc]], July 19, 2001
* [https://www.stmintz.com/ccc/index.php?id=181281 PONDER=ON and TableBases on 1 PC] by [[Matthias Gemuh]], [[CCC]], July 27, 2001 » [[Pondering]]
* [https://www.stmintz.com/ccc/index.php?id=192968 Nalimov's EGTBs (long post with code)] by [[Heiner Marxen]], [[CCC]], October 13, 2001
* [https://www.stmintz.com/ccc/index.php?id=195809 Incomplete egtbs can be harmful] by [[Leen Ammeraal]], [[CCC]], November 06, 2001
* [https://www.stmintz.com/ccc/index.php?id=200335 Generating egtbs ICGAJ] by [[Tony van Roon-Werten|Tony Werten]], [[CCC]], December 04, 2001 <ref>[[Ren Wu]], [[Don Beal]] ('''2001'''). ''Fast, Memory-efficient Retrograde Algorithms''. [[ICGA Journal#24_3|ICGA Journal, Vol. 24, No. 3]]</ref> <ref>[http://www.abc.se/~m10051/eg.txt Computing endgames with few men] by [[Urban Koistinen]]</ref>
: [https://www.stmintz.com/ccc/index.php?id=200376 Wu/Beal predates Koistinen] by [[Guy Haworth]], [[CCC]], December 04, 2001
* [https://www.stmintz.com/ccc/index.php?id=203322 3-3 tablebase (with pawns) suggestion] by [[Shane Hudson]], [[CCC]], December 23, 2001
* [https://www.stmintz.com/ccc/index.php?id=224008 Interesting EGTB bug] by [[Tom Likens]], [[CCC]], April 16, 2002
* [https://www.stmintz.com/ccc/index.php?id=287563 How to handle EGTB stalemates] by [[Tom Likens]], [[CCC]], March 02, 2003 » [[Stalemate]]
* [https://www.stmintz.com/ccc/index.php?id=290629 EGTB generation with 1 bit per position?] by [[Martin Fierz]], [[CCC]], March 25, 2003
* [https://www.stmintz.com/ccc/index.php?id=316547 Frank Phillips' KNNKP position revisited ...] by [[Guy Haworth]], [[CCC]], September 18, 2003 <ref>[https://www.stmintz.com/ccc/index.php?id=315666 Easy mate] by [[Frank Phillips]], [[CCC]], September 13, 2003 » [[Checkmate]]</ref>
==2005 ...==
* [http://www.open-aurec.com/wbforum/viewtopic.php?f=4&t=4118 EGTB question] by [[Stef Luijten]], [[Computer Chess Forums|Winboard Forum]], January 09, 2006
* [http://www.open-aurec.com/wbforum/viewtopic.php?f=4&t=4307 EGTB compression] by [[Stef Luijten]], [[Computer Chess Forums|Winboard Forum]], February 10, 2006
* [http://kirill-kryukov.com/chess/discussion-board/viewtopic.php?f=6&t=2759 utility for testing tablebases integrity] by [[Victor Zakharov]], [[Computer Chess Forums|CCRL Discussion Board]], October 24, 2007
* [http://www.talkchess.com/forum/viewtopic.php?t=19178 EGTB compression (H. G. Muller tablebase...)] by [[Dann Corbit]], [[CCC]], January 25, 2008
* [http://kirill-kryukov.com/chess/discussion-board/viewtopic.php?f=6&t=3934 DTR is no good!] by [[Harm Geert Muller]], [[Computer Chess Forums|CCRL Discussion Board]], September 24, 2008
* [http://www.talkchess.com/forum/viewtopic.php?t=25311 Gaviota's Endgame Tablebases] by [[Miguel A. Ballicora]], [[CCC]], December 07, 2008 » [[Gaviota Tablebases]]
* [http://www.talkchess.com/forum/viewtopic.php?t=25546 Creating EGTBs] by [[Carey Bloodworth|Carey]], [[CCC]], December 21, 2008
* [http://www.talkchess.com/forum/viewtopic.php?t=26184 Other endgame tablebase generators] by [[Denis Mendoza|Denis P. Mendoza]], [[CCC]], January 23, 2009
==2010 ...==
* [http://www.open-chess.org/viewtopic.php?f=3&t=778 Some tablebase formats] by [[Mark Watkins|BB+]], [[Computer Chess Forums|OpenChess Forum]], November 25, 2010
* [http://www.open-chess.org/viewtopic.php?f=5&t=779 Retrograde tablebase methods] by [[Mark Watkins|BB+]], [[Computer Chess Forums|OpenChess Forum]], November 26, 2010
'''2011'''
* [http://www.talkchess.com/forum/viewtopic.php?t=38372 Gaviota tablebases, probing code v4 (UPDATE)] by [[Miguel A. Ballicora]], [[CCC]], March 11, 2011
* [http://www.open-chess.org/viewtopic.php?f=5&t=1364 Large tablebases] by [[Mark Watkins|BB+]], [[Computer Chess Forums|OpenChess Forum]], April 21, 2011
* [http://kirill-kryukov.com/chess/discussion-board/viewtopic.php?f=6&t=6142 Mapping the 7-men computation] by Astokes, [[Computer Chess Forums|CCRL Discussion Board]], September 21, 2011
* [http://www.talkchess.com/forum/viewtopic.php?t=41435 Poor Man Table Base] by [[Ed Schroder]], [[CCC]], December 13, 2011
* [http://www.talkchess.com/forum/viewtopic.php?t=41467 Number sequence puzzle] by [[Steven Edwards]], [[CCC]], December 16, 2011 <ref>[http://oeis.org/A018214 A018214 - OEIS | Alkane (or paraffin) numbers]</ref>
* [http://www.talkchess.com/forum/viewtopic.php?t=41524 Tablebase class name list available] by [[Steven Edwards]], [[CCC]], December 19, 2011 » [[CookieCat]]
'''2012'''
* [http://www.talkchess.com/forum/viewtopic.php?t=44347 Compression of chess databases] by [[Edmund Moshammer]], [[CCC]], July 09, 2012
* [http://www.talkchess.com/forum/viewtopic.php?t=44553 pawn enumeration] by [[Daniel Shawul]], [[CCC]], July 24, 2012
'''2013'''
* [http://www.talkchess.com/forum/viewtopic.php?t=47681 New 6-piece tablebases] by [[Ronald de Man]], [[CCC]], April 01, 2013 » [[Syzygy Bases]]
* [http://www.talkchess.com/forum/viewtopic.php?t=47768 Complete 7-piece tablebases are out!] by [[Albert Silver]], [[CCC]], April 12, 2013 <ref>[http://chessok.com/?page_id=27966 Lomonosov Endgame Tablebases] - [[ChessOK]]</ref>
* [http://www.talkchess.com/forum/viewtopic.php?t=49592 Multithreaded LRU] by [[Alvaro Cardoso]], [[CCC]], October 06, 2013 » [[Memory]]
* [http://www.talkchess.com/forum/viewtopic.php?t=49684 What happens using egbb] by [[Kai Laskos]], [[CCC]], October 12, 2013 » [[Scorpio Bitbases]]
* [http://www.talkchess.com/forum/viewtopic.php?t=49702 tablebase caching / mmap() / page cache] by [[Ronald de Man]], [[CCC]], October 13, 2013 » [[Memory]], [[Syzygy Bases]]
* [http://rybkaforum.net/cgi-bin/rybkaforum/topic_show.pl?tid=27815 How to encode endgame tablebases] by Mr. beo, [[Computer Chess Forums|Rybka Forum]], October 18, 2013
* [http://www.talkchess.com/forum/viewtopic.php?t=49805 Could EGTB make an Engine "weaker"?] by Bill Henry, [[CCC]], October 23, 2013
* [http://www.talkchess.com/forum/viewtopic.php?t=50194 evaluating tablebases draws] by [[Uri Blass]], [[CCC]], November 23, 2013 » [[Draw Evaluation]]
* [http://www.talkchess.com/forum/viewtopic.php?t=50334 Table Base Cache Size question] by Rob Nicholas, [[CCC]], December 05, 2013 » [[Memory]]
'''2014'''
* [http://www.talkchess.com/forum/viewtopic.php?t=50894 Scorpio 6men EGBB Now available] by [[Joshua Shriver]], [[CCC]], January 14, 2014 » [[Scorpio Bitbases]]
* [http://www.talkchess.com/forum/viewtopic.php?t=50962 On-demand tablebase generation] by [[Evert Glebbeek]], [[CCC]], January 19, 2014
* [http://www.talkchess.com/forum/viewtopic.php?t=51847 Endgame tablebase generation for newbies] by [[Alberto Sanjuan]], [[CCC]], April 04, 2014
* [http://www.talkchess.com/forum/viewtopic.php?t=53244 A different tablebase encoding format] by [[Steven Edwards]], [[CCC]], August 10, 2014
* [http://www.talkchess.com/forum/viewtopic.php?t=54064 Tablebase access using a Solid State Disk] by [[Steven Edwards]], [[CCC]], October 16, 2014 » [[Memory]]
==2015 ...==
* [http://www.talkchess.com/forum/viewtopic.php?t=56363 how to probe egtb from console?] by [[Marco Belli]], [[CCC]], May 15, 2015 » [[CLI]]
* [http://www.talkchess.com/forum/viewtopic.php?t=57517 Yet another KPK endgame table generator: pfkpk] by [[Marcel van Kervinck]], [[CCC]], September 05, 2015 » [[KPK]] [[Endgame Bitbases|Bitbase]] <ref>[https://github.com/kervinck/pfkpk kervinck/pfkpk · GitHub]</ref>
* [http://www.talkchess.com/forum/viewtopic.php?t=57331 Is there tools to get the longest DTM/DTC for elementary EG?] by [[Vincent Lejeune]], [[CCC]], September 07, 2015
* [http://www.talkchess.com/forum/viewtopic.php?t=57539 7 men Rook endgames H4 vs SF in recent TCEC stage 1b] by Nay Lin Tun, [[CCC]], September 07, 2015 » [[Rook Endgame]], [[TCEC Season 8]]
'''2016'''
* [http://www.talkchess.com/forum/viewtopic.php?t=59237 Nalimov EGTB problem related to DTM?] by [[Kai Laskos]], [[CCC]], February 14, 2016 » [[Nalimov Tablebases]], [[Endgame Tablebases#DTM|DTM]]
: [http://www.talkchess.com/forum/viewtopic.php?t=59237&start=7 Re: Nalimov EGTB problem related to DTM?] by [[Ronald de Man]], [[CCC]], February 14, 2016
* [http://www.talkchess.com/forum/viewtopic.php?t=59422 6-men tablebase wanted] by [[Harm Geert Muller]], [[CCC]], March 03, 2016
* [http://www.talkchess.com/forum/viewtopic.php?t=60169 Good testsets for tablebases testing] by [[Sergei Markoff|Sergei S. Markoff]], [[CCC]], May 15, 2016 » [[Test-Positions]]
: [http://www.talkchess.com/forum/viewtopic.php?t=60244 EPD to test EGTB probe code] by [[Sergei Markoff|Sergei S. Markoff]], [[CCC]], May 24, 2016
* [http://www.talkchess.com/forum/viewtopic.php?t=60255 11-men tablebases (XQ)] by [[Harm Geert Muller]], [[CCC]], May 23, 2016 » [[Chinese Chess|Xiangqi]]
* [http://www.talkchess.com/forum/viewtopic.php?t=60312 Natural TB] by [[Marco Costalba]], [[CCC]], May 29, 2016 » [[Syzygy Bases]], [[Stockfish]]
* [http://www.talkchess.com/forum/viewtopic.php?t=60833 How texel probes endgame tablebases] by [[Peter Österlund]], [[CCC]], July 16, 2016 » [[Gaviota Tablebases]], [[Syzygy Bases]], [[Texel]]
* [http://www.talkchess.com/forum/viewtopic.php?t=60873 Getting engines to use TBs in Arena] by [[Brendan J. Norman]], [[CCC]], July 19, 2016 » [[Arena]]
* [http://www.talkchess.com/forum/viewtopic.php?t=60906 Syzygy and draw by repetition] by [[Jon Dart]], [[CCC]], July 22, 2016 » [[Draw]], [[Repetitions]], [[Syzygy Bases]]
* [http://www.talkchess.com/forum/viewtopic.php?t=60918 Verifiability of endgame tablebases] by Joan Charmant, [[CCC]], July 23, 2016
'''2017'''
* [http://www.talkchess.com/forum/viewtopic.php?t=63153 Checkers Is Strongly-Solved for 8-pieces] by [[Ed Trice]], [[CCC]], February 12, 2017 » [[Checkers]]
* [http://www.talkchess.com/forum/viewtopic.php?t=63314 Search Halting Criteria When Probing Tablebases] by [[Ed Trice]], [[CCC]], March 02, 2017
* [http://www.talkchess.com/forum/viewtopic.php?t=64030 Probe EGT in quiescence?] by [[Pham Hong Nguyen|Nguyen Pham]], [[CCC]], May 20, 2017 » [[Quiescence Search]], [[Chinese Chess|Xiangqi]]
* [http://www.talkchess.com/forum/viewtopic.php?t=64059 Incorporating Endgame tablebases] by Pranav Deshpande, [[CCC]], May 24, 2017
* [http://www.talkchess.com/forum/viewtopic.php?t=64767 EGTB probe in search] by [[Erin Dame]], [[CCC]], July 30, 2017
* [http://www.talkchess.com/forum/viewtopic.php?t=60312&start=240 Natural TB (take 2)] by [[Marco Costalba]], [[CCC]], August 22, 2017 » [[Syzygy Bases]], [[Stockfish]]
* [http://www.talkchess.com/forum/viewtopic.php?t=65390 understanding DTZ] by [[Alexandru Mosoi]], [[CCC]], October 06, 2017 » [[Endgame Tablebases#DTZ|DTZ]], [[Syzygy Bases]], [[Syzygy Bases#Fathom|Fathom]]
'''2018'''
* [http://www.talkchess.com/forum/viewtopic.php?t=66337 A new design for Xianqgi (Chinese chess) Endgame Tablebase] by [[Pham Hong Nguyen|Nguyen Pham]], [[CCC]], January 16, 2018 » [[Chinese Chess]]
* [http://www.talkchess.com/forum/viewtopic.php?t=66423 Question about EGT formats] by [[Harm Geert Muller]], [[CCC]], January 26, 2018
* [http://www.talkchess.com/forum/viewtopic.php?t=66754 The history of Syzygy tablebases] by Isaac Haïk Dunn, [[CCC]], March 06, 2018 » [[Syzygy Bases]]
=External Links=
* [[ICGA#Topics]]: [http://ilk.uvt.nl/icga/games/chess/endgames.php Chess Endgames] compiled by [[Guy Haworth]] and colleagues
* [https://en.wikipedia.org/wiki/Endgame_tablebase Endgame tablebase from Wikipedia]
* [http://computer-chess.org/doku.php?id=computer_chess:wiki:lists:egtbs_list Endgame Tablebases and Bitbases List] from [http://computer-chess.org/doku.php?id=home Computer-Chess Wiki] by [[Ron Murawski]]
* [http://quux.org:70/Archives/usenet-a-news/NET.chess/82.01.07_sri-unix.458_net.chess.txt QUEEN vs. ROOK] by [http://www.highbeam.com/doc/1G1-62632443.html Warren Stenberg] and Edware J. Conway, reprinted from the January, 1979 issue of the Minnesota Chess Journal, The Usenet Oldnews Archive, Compilation Copyright (C) 1981, 1996 Bruce Jones, Henry Spencer, David Wiseman » [[ACM 1978]], [[Belle]], [https://en.wikipedia.org/wiki/Walter_Browne Walter Browne]
* [http://www.gilith.com/chess/endgames/ Gilith - Chess Endgames] by [[Joe Leslie-Hurd]]
* [http://sites.google.com/site/gaviotachessengine/Home/endgame-tablebases-1 Endgame Tablebases - gaviota chess engine] by [[Miguel A. Ballicora]] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=38372 Gaviota tablebases, probing code v4 (UPDATE)] by [[Miguel A. Ballicora]], [[CCC]], March 11, 2011</ref>
: [http://sites.google.com/site/gaviotachessengine/schemes Compression Schemes for Gaviota Tablebases]
* [http://www.abc.se/~m10051/eg.txt Computing endgames with few men] by [[Urban Koistinen]] <ref>[https://www.stmintz.com/ccc/index.php?id=162252 EGTB: Better algorithm] by [[Urban Koistinen]], [[CCC]], April 07, 2001</ref> <ref>[https://www.stmintz.com/ccc/index.php?id=200335 Generating egtbs ICGAJ] by [[Tony van Roon-Werten|Tony Werten]], [[CCC]], December 04, 2001</ref> <ref>[[Ren Wu]], [[Don Beal]] ('''2001'''). ''Fast, Memory-efficient Retrograde Algorithms''. [[ICGA Journal#24_3|ICGA Journal, Vol. 24, No. 3]]</ref>
* [https://github.com/Koistinen/Endgame Koistinen/Endgame · GitHub]
* [http://home.hccnet.nl/h.g.muller/EGTB.html End-Game Table Bases] by [[Harm Geert Muller]]
* [http://home.hccnet.nl/h.g.muller/EGT7/7-men.html The Leapfrog Tablebase Generator] by [[Harm Geert Muller]]
* [http://www.freesoft.org/software/hoffman/ Hoffman] by [[Brent Baccala]]
* [http://www.vlasak.biz/tablebase.htm Endgame databases] by [[Emil Vlasák]]
* [http://kirill-kryukov.com/chess/discussion-board/viewforum.php?f=6 CCRL Discussion Board - Endgame Tablebases]
* [http://www.horizonchess.com/FAQ/Winboard/egtb.html Guide to the use of Computer Chess Endgame Tablebases] from [http://www.horizonchess.com/FAQ/Winboard/index.html FAQ on Winboard and Chess Engines] by [[Aaron Tay]]
* [http://www.horizonchess.com/FAQ/Winboard/weaktablebase.html Can use of endgame tablebases weaken play?] from [http://www.horizonchess.com/FAQ/Winboard/index.html FAQ on Winboard and Chess Engines] by [[Aaron Tay]]
* [http://rjlipton.wordpress.com/2010/05/12/can-we-solve-chess-one-day/ Can We Solve Chess One Day? | Gödel's Lost Letter and P=NP] by [[Mathematician#RJLipton|Dick Lipton]], May 12, 2010
* [https://plus.google.com/100454521496393505718/posts 7-man TB] - [https://en.wikipedia.org/wiki/Google%2B Google+]
* [https://github.com/syzygy1/tb syzygy1/tb · GitHub] by [[Ronald de Man]] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=47681 New 6-piece tablebases] by [[Ronald de Man]], [[CCC]], April 01, 2013</ref>
* [https://github.com/dshawul/Scorpio dshawul/Scorpio · GitHub] includes Six men egbb code » [[Scorpio Bitbases]] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=50894 Scorpio 6men EGBB Now available] by [[Joshua Shriver]], [[CCC]], January 14, 2014</ref>
* [https://github.com/kervinck/pfkpk kervinck/pfkpk · GitHub] » [[KPK]] [[Endgame Bitbases|Bitbase]] by [[Marcel van Kervinck]] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=57517 Yet another KPK endgame table generator: pfkpk] by [[Marcel van Kervinck]], [[CCC]], September 05, 2015</ref>
==[[ChessBase]]==
* [http://en.chessbase.com/post/engines-and-endgame-tablebases Engines and endgame tablebases] by [[Albert Silver]], [[ChessBase|ChessBase News]], December 12, 2013
* [http://en.chessbase.com/post/perfect-endgame-play-with-tablebases Perfect endgame play – with tablebases], [[ChessBase|ChessBase News]], April 21, 2015
* [http://en.chessbase.com/post/just-one-of-17-823-400-766-positions-2 Just one of 17,823,400,766 positions] by [[Frederic Friedel]], [[ChessBase|ChessBase News]], April 23, 2015
==[[ChessOK]]==
* [http://chessok.com/?page_id=27966 Lomonosov Endgame Tablebases]
==Online Lookup==
* [http://tb7.chessok.com/ Lomonosov - online 7-man tablebases]
* [http://chessok.com/?page_id=361 Endgame Nalimov Tablebases Online] by [[ChessOK]]
* [http://www.gmchess.com/endgames/ Nalimov EGTB] from [http://www.gmchess.com/index.html GMchess.com]
* [http://www.lokasoft.nl/tbweb.htm Nalimov Tablebase server (DTM)] by [[Lokasoft]]
* [http://www.k4it.de/index.php?topic=egtb&lang=en Web Query for Nalimov Endgame Tablebases (DTM)] from [http://www.k4it.de/index.php?topic=impressum&lang=en Knowledge4IT] by [[Eiko Bleicher]]
* [http://chess.jaet.org/endings/ Chess Archives - Endgames (DTC, DTM, DTZ, DTZ-50)] hosted by [[John Tamplin]]
* [http://www.rack.de/chess/endspiele.cgi Schach Endspiele (DTM)] (German) by [http://www.rack.de Joachim Rack]
==Download==
* [http://kirill-kryukov.com/chess/tablebases-online/ Endgame Tablebases Online - 6-men endgame analysis free for everyone] by [[Kirill Kryukov]] (3,4,5,6 pieces - via [https://en.wikipedia.org/wiki/EMule emule])
* [http://chess.cygnitec.com/tablebases/ Index of /tablebases] by [[Franklin Titus|kingliveson]]
* [http://tablebase.sesse.net/ tablebase.sesse.net] by [[Steinar H. Gunderson|Sesse]]
==Statistics==
* [http://cm.bell-labs.com/who/ken/chesseg.html 6-Piece Database Statistics] by [[Ken Thompson]], 2000
* [http://scid.sourceforge.net/tbstats.html Tablebase endgame frequency statistics]
* [http://www.mathematik.uni-stuttgart.de/~thiel/misc/endgames/ Theoretical statistics for chess endgames with up to five pieces] by [[Mathematician#UlrichThiel|Ulrich Thiel]]
=References=
<references />
'''[[Knowledge|Up one level]]'''
[[FILE:SamuaelBakPersistence.jpg|border|right|thumb|link=http://chgs.elevator.umn.edu/asset/viewAsset/57f3b6787d58ae5f74bf8ba9#57f3b6d77d58ae5574bf8bd8|[[Arts#Bak|Samuel Bak]] - Persistence <ref>[http://chgs.elevator.umn.edu/asset/viewAsset/57f3b6787d58ae5f74bf8ba9#57f3b6d77d58ae5574bf8bd8 Chess in the Art of Samuel Bak], [http://www.chgs.umn.edu/ Center for Holocaust & Genocide Studies], [https://en.wikipedia.org/wiki/University_of_Minnesota University of Minnesota]</ref> ]]
'''Endgame Tablebases''', (EGTBs or EGTs)<br/>
precalculated [[Endgame|endgame]] [https://en.wikipedia.org/wiki/Table_%28database%29 tables] generated by an exhaustive [[Retrograde Analysis|retrograde analysis]]. During its [[Chess Game|game play]] and/or [[Search|search]], [[Interior Node Recognizer|recognizing]] a specific [[Material|material composition]], a chess program can probe, or in principle compute these tables to determine the outcome of positions definitively and act as an [[Oracle|oracle]] providing the optimal moves. The tables are usually divided into separate [https://en.wikipedia.org/wiki/Computer_file files] for each material configuration and [[Side to move|side to move]]. What all different [[Endgame Tablebases#Formats|formats]] of tablebases have in common is that every possible piece placement has its own, unique index number which represents the position where the information about the position is located in the file. Positions with non-null castling rights could be represented in an EGT but typically are not.
The term '''Tablebase''' opposed to endgame database was coined by [[Steven Edwards]] by means of a data vector and a single file access for both sides to move, when he introduced his [[Edwards' Tablebases]], addressing several shortcomings of [[Ken Thompson|Ken Thompson's]] earlier [[Thompson's Databases|database]] of positions with the weaker and hence potentially losing side to move only <ref>[[Ernst A. Heinz]] ('''1999'''). ''Endgame Databases and Efficient Index Schemes for Chess.'' [[ICGA Journal#22_1|ICCA Journal, Vol. 22, No. 1]], [http://people.csail.mit.edu/heinz/ps/edb_index.ps.gz ps]</ref> .
=Metrics=
==DTM<span id="DTM"></span>==
'''Depth to Mate'''
'Mate' is the ultimate goal and ends the game. For each position that is represented, 'DTM' indicates the theoretical value, and the number of winner's moves to 'Mate' if won/lost - assuming that the winner is minimizing and the loser is maximizing DTM.
==DTC<span id="DTC"></span>==
'''Depth to Conversion'''
'Conversion' is the changing of the force on the board, by capture and/or Pawn-conversion. For each position that is represented, 'DTC' indicates the theoretical value, and the number of winner's moves to the goal of 'Won Conversion' if won/lost - assuming that the winner is minimizing and the loser is maximizing DTC. DTC <span style="font-family: Symbol;">£ </span>DTM.
==DTZ<span id="DTZ"></span>==
'''Depth to Zeroing (of the ply count)'''
The ply-count is zeroed if and only if a Pawn is pushed or a capture is made. For each position that is represented, 'DTZ' indicates the theoretical value, and the number of winner's moves to the goal of 'Win and ply-count zeroed' if won/lost - assuming that the winner is minimizing and the loser is maximizing DTZ. DTZ <span style="font-family: Symbol;">£ </span>DTC <span style="font-family: Symbol;">£ </span>DTM.
==DTZ50<span id="DTZ50"></span>==
'''Depth to Zeroing (of the ply count) in the context of the ''50-Move'' ''Rule'''''
The DTC, DTM and DTZ metrics do not consider the current FIDE [[Fifty-move Rule|50-move rule]] whereby a game in which no [[Irreversible Moves|irreversible moves]] have been played for 100 plies can be claimed as a draw by the player 'on move'. In this metric, in addition to the DTC/DTM/DTZ ''draws'', positions requiring more than 50 winner's moves to zero the ply-count are defined as ''draws''. DTZ <span style="font-family: Symbol;">£ </span>DTZ50 if DTZ50 <span style="font-family: Symbol; font-size: 14.66px;">¹ </span>''draw.'' 'DTZ50' is one of a set of 'DTZk' rules: a ''k''-''move rule'' effectively applies if there are only ''k'' moves left before a draw-claim might be made. ''k1'' <span style="font-family: Symbol;">£ </span>''k2'' implies ''DTZk2'' <span style="font-family: Symbol;">£ </span>''DTZk1 if DTZk1'' <span style="font-family: Symbol; font-size: 14.66px;">¹ </span>draw.
Note that, because depth is measured in winner's moves rather than plies, this metric does '''not''' define as ''draw'' a position in which 50 winner's moves and 51 loser's moves are required to zero the ply-count, despite the fact that the loser would claim a draw after 100 plies had been played in that endgame.
==DTR<span id="DTR"></span>==
'''Depth by the (''k''-move) Rule'''
'The Rule' referred to here is a notional set of ''k''-move rules. For each position that is represented, 'DTR' indicates the theoretical value and, for won/lost positions'','' the least ''k'' for which DTZ''k'' is not ''draw'' - assuming that the winner is minimising and the loser is maximising DTR. DTZ <span style="font-family: Symbol;">£ </span>DTR. No DTR EGTs have been created to date <ref>[http://kirill-kryukov.com/chess/discussion-board/viewtopic.php?f=6&t=3934 DTR is no good!] by [[Harm Geert Muller]], [[Computer Chess Forums|CCRL Forum]], September 24, 2008</ref> .
==DTZR<span id="DTZR"></span>==
'''Depth to Zeroing move, give that DTR is being minimaxed'''
If DTR = ''draw'', then DTZR = ''draw''. Otherwise, Otherwise DTRZR indicates the theoretical value, and the number of winner's moves to the zeroing of the ply count, given that the two sides are minimaxing first DTR and then DTZR. DTZR would be used in conjunction with DTR to progress a deep win in the context of a ''k''-move rule because DTR can remain unchanged over a sequence of moves. DTZR <span style="font-family: Symbol;">£ </span>DTR but it is not always the case that DTZ <span style="font-family: Symbol;">£ </span>DTZR as may seem intuitively obvious: the loser may zero the move-count to maximise DTR.
==Summary==
To summarize the different metrics of tablebases, each metric has its strengths and weaknesses. [[Nalimov Tablebases|Nalimov's DTM EGTs]] are widely and commercially available, and used by many chess engines or chess GUIs. DTC EGTs are more easily computed and stored as they involve smaller depth-ranges and are more compressible. For endgames with less or equal than 5 pieces on the board, KNNKP comes closest to requiring more than one [[Byte]] per position to store DTM: maxDTM = 115 (1-0) and 73 (0-1) necessitating 190 values in the EGT. For KPPKP, maxDTM = 127 (1-0) but only 42 (0-1). But for certain 6 piece endgames, one Byte is not enough: maxDTM = 262 for a KRNKNN position. The DTC and DTZ metrics increasingly postpone the need for two Bytes per position in an uncompressed EGT, but KRBNKQN has maxDTC = maxDTZ = 517 (0-1), both wtm and btm.
In extremis, he unmoderated use of DTM, DTC or DTZ EGTs will let slip a winnable position in the context of the 50-move rule ... hence the marginal need for the DTR and DTZR metrics, coupled with the ability to recompute DTR/DTZR EGTs in the context of a limited move-budget.
<span id="Bitbases"></span>
=Bitbases=
''see main article [[Endgame Bitbases]]''
Inside the [[Search|search]] much denser tables with value {''won'', ''draw'', ''loss'', ''invalid''} or boolean {''win'', ''not_win''} information are sufficient with respect to [[Bound|bounds]]. Denser tables are more efficiently used, given that [[Memory|memory]] and cache are limited resources. Boolean ''Win/Not_Win'' Bitbases require only one bit per position (and if necessary, further enquiry if ''draw'' is to be distinguished from ''loss'' with respect to [[Bound|bounds]]). ''Value'' Bitbases require two bits per position.
=Indexing=
Every position is assigned to an unique index to specify the location of the information stored about it. There are two main aims when generating the index number. The easier the algorithm to generate the index from any given position, the faster will be the probing of the tablebase as well as the generation of it. But the second aim is to get a relatively small range of index-numbers, to keep the size of the file as small as possible.
The most straight forward way would be to for every piece on the board use 6 bit (1-64 squares)
<pre>
index = position_white_King + position_black_King * 64
for each piece {
index = index * 64 + position
}
</pre>
This can be optimized in several ways.
A chess board can be rotated and mirrored (if pawns are on the board only a vertical reflection is possible).
* Pieces may not stand on the same square.
* For pieces of the same type, different arrangements can be left away.
* The side to move may not give check.
* The distance between the two Kings must be greater than one.
=Brief Info=
of some popular Endgame tablebases:
{| class="wikitable"
|-
! Format
! Metric
! 1st published
! 5 men
! 6 men
! 7 men
|-
| [[Thompson's Databases|Thompson]]
| style="text-align:center;" | [[Endgame Tablebases#DTC|DTC]]
| style="text-align:center;" | 1991
| 2.5 [https://en.wikipedia.org/wiki/Gibibyte GiB] (not completed)
| style="text-align:center;" | -
| style="text-align:center;" | -
|-
| [[Edwards' Tablebases|Edwards]]
| style="text-align:center;" | [[Endgame Tablebases#DTM|DTM]]
| style="text-align:center;" | 1994
| 56 GiB (estimated)
| style="text-align:center;" | -
| style="text-align:center;" | -
|-
| [[Nalimov Tablebases|Nalimov]]
| style="text-align:center;" | DTM
| style="text-align:center;" | 1998
| 7.1 GiB
| style="text-align:center;" | 1.2 [https://en.wikipedia.org/wiki/Tebibyte TiB]
| style="text-align:center;" | -
|-
| [[Scorpio Bitbases|Scorpio]]
| style="text-align:center;" | [[Endgame Tablebases#Bitbases|WDL]]
| style="text-align:center;" | 2005
| 214 [https://en.wikipedia.org/wiki/Mebibyte MiB]
| style="text-align:center;" | 48.1 GiB
| style="text-align:center;" | -
|-
| [[Gaviota Tablebases|Gaviota]]
| style="text-align:center;" | DTM
| style="text-align:center;" | 2008
| 6.5 GiB
| style="text-align:center;" | -
| style="text-align:center;" | -
|-
| [[Lomonosov Tablebases|Lomonosov]]
| style="text-align:center;" | DTM
| style="text-align:center;" | 2012
| style="text-align:center;" | -
| style="text-align:center;" | -
| style="text-align:center;" | 140 TiB
|-
| [[Syzygy Bases|Syzygy]]
| style="text-align:center;" | WDL + [[Endgame Tablebases#DTZ50|DTZ50]]
| style="text-align:center;" | 2013
| 939 MiB
| style="text-align:center;" | 150.2 GiB
| style="text-align:center;" | -
|}
<span id="Formats"></span>
=Formats=
* [[Chenard#EGDB|Chenard's EGDB]]
* [[Edwards' Tablebases]]
* [[Gaviota Tablebases]]
* [[Lomonosov Tablebases]]
* [[Nalimov Tablebases]]
* [[RetroChess]]
* [[Scorpio Bitbases]]
* [[Syzygy Bases]]
* [[Thompson's Databases]]
=Generators=
* [[FinalGen]]
* [[Freezer]]
* [[GAFS]]
<span id="7-men"></span>
=7-man EGTBs=
==2005==
In 2005, [[Yakov Konoval]] started to collaborate with [[Marc Bourzutschky]] on constructing 7-man EGTBs. Yakov wrote the generator and Marc a verification program and some utilities for extracting the data. In October 2005, Yakov Konoval and Marc Bourzutschky announced that a position in the ending of a KRRNkrr requires 290 moves to convert to a simpler winning endgame <ref>[https://www.stmintz.com/ccc/index.php?id=456178 Subject: KRRNKRR win in 290: a new record] by [[Marc Bourzutschky]] from [[CCC]], October 16, 2005</ref> . The old record was 243 moves from a position in a rook and knight versus two knights endgame, discovered by [[Lewis Stiller]] in 1991 <ref>[https://en.wikipedia.org/wiki/Chess_endgame Chess endgame from Wikipedia]</ref> .
==2006==
In March 2006, the wizards of 7-men endgames, Marc Bourzutschky and Yakov Konoval found a 330 moves win in KQBNkqb <ref>[http://www.xs4all.nl/~timkr/chess2/diary_16.htm 311. 31 March 2006: White plays and wins in 330 moves] by [https://en.wikipedia.org/wiki/Tim_Krabb%C3%A9 Tim Krabbé]</ref> and in May 2006 a 517 moves win in KQNkrbn <ref>[http://www.xs4all.nl/~timkr/chess2/diary_16.htm OPEN CHESS DIARY 316. 26 May 2006: A 517-move win] by [https://en.wikipedia.org/wiki/Tim_Krabb%C3%A9 Tim Krabbé]</ref> .
==2012==
In July 2012, [[Vladimir Makhnychev]] and [[Victor Zakharov]] from [[Moscow State University]] completed 4+3 DTM-tablebases (525 endings including KPPPKPP). The next set of 5+2 DTM-tablebases was completed during August 2012 <ref>[https://en.wikipedia.org/wiki/Endgame_tablebase#Background Endgame tablebase from Wikipedia - Background]</ref> . The tablebases are named [[Lomonosov Tablebases]], using the [[Lomonosov Supercomputer]].
==2013==
[[ChessOK|Convekta Ltd.]] announced the release of [[Lomonosov Tablebases]]. Until December 31, 2013, the tablebases will be available online through [[ChessOk]] [[ChessOk#Products|products]] <ref>[http://chessok.com/?page_id=27966 Lomonosov Endgame Tablebases] - [[ChessOK]]</ref> .
=See also=
* [[Retrograde Analysis]]
* [[Endgame]]
* [[Interior Node Recognizer]]
* [[KPK]]
* [[Oracle]]
=Selected Publications=
==1965 ...==
* [[Richard E. Bellman]] ('''1965'''). ''[http://www.rand.org/pubs/papers/P3013/ On the application of dynamic programming to the determination of optimal play in chess and checkers].'' Proceedings of the National Academy of Sciences of the United States of America. [http://www.ncbi.nlm.nih.gov/pmc/articles/PMC219499/pdf/pnas00154-0020.pdf pdf]
==1970 ...==
* [[Thomas Ströhlein]] ('''1970'''). ''Untersuchungen über kombinatorische Spiele.'' Ph.D. Thesis, [[Technical University of Munich]] (German)
* [[Edward Komissarchik]], [[Aaron L. Futer]] ('''1974'''). ''Ob Analize Ferzevogo Endshpilya pri Pomoshchi EVM.'' (Analysis of a queen endgame using an IBM computer) Problemy Kybernetiki, Vol. 29, pp. 211-220. English translation by [[Christian Posthoff|C. Posthoff]], revised in [[ICGA Journal#9_4|ICCA Journal, Vol. 9, No. 4]] ('''1986''')
==1975 ...==
* [http://www.mathnet.ru/php/person.phtml?option_lang=eng&personid=55935 A. G. Alexandrov], [http://www.mathnet.ru/php/person.phtml?option_lang=eng&personid=96113 A. M. Baraev], [http://www.mathnet.ru/php/person.phtml?option_lang=eng&personid=96114 Ya. Yu. Gol'fand], [[Edward Komissarchik]], [[Aaron L. Futer]] ('''1977'''). ''[http://www.mathnet.ru/php/archive.phtml?wshow=paper&jrnid=at&paperid=7425&option_lang=eng Computer analysis of rook end game]''. [https://en.wikipedia.org/wiki/Automation_and_Remote_Control Avtomatika i Telemekhanika], No. 8, 113–117
* [http://www.mathnet.ru/php/person.phtml?option_lang=eng&personid=55935 A. G. Alexandrov], [[Vladimir Arlazarov]], [http://www.mathnet.ru/php/person.phtml?option_lang=eng&personid=96113 A. M. Baraev], [http://www.mathnet.ru/php/person.phtml?option_lang=eng&personid=96114 Ya. Yu. Gol'fand], [https://zbmath.org/authors/?q=ai:deza.v-n V. N. Deza], [https://zbmath.org/authors/?q=ai:ilina.t-p T. P. Il’ina], [[Edward Komissarchik]], [[Anatoly Uskov]], [https://zbmath.org/authors/?q=ai:faradzhev.i-a I. A. Faradzhev], [[Aaron L. Futer]] ('''1977'''). ''[https://zbmath.org/?q=an:03653550 Processing of large files of information on the example of the analysis of the rook’s end game]''. [http://www.springer.com/computer/journal/11086 Programming and Computer Software], No. 3
* [[Thomas Ströhlein]], [[Ludwig Zagler]] ('''1977'''). ''[http://www.sciencedirect.com/science/article/pii/0012365X77900334 Analyzing games by Boolean matrix iteration]''. [https://en.wikipedia.org/wiki/Discrete_Mathematics_%28journal%29 Discrete Mathematics], Vol. 19, No. 2
* [[Thomas Ströhlein]], [[Ludwig Zagler]] ('''1978'''). ''Ergebnisse einer vollstandigen Analyse von Schachendspielen: König und Turm gegen König, König und Turm gegen König und Laufer.'' Report, Institut für Informatik, [[Technical University of Munich]] (German)
* [[Max Bramer]] ('''1978'''). ''Computer-Generated Databases for the Endgame in Chess.'' Technical Report. [https://en.wikipedia.org/wiki/Milton_Keynes Milton Keynes], [https://en.wikipedia.org/wiki/Open_University Open University] Faculty of Mathematics.
* [[Aaron L. Futer]] ('''1978'''). ''[https://zbmath.org/?q=an:03637634 Programming endgames with few pieces]''. [https://en.wikipedia.org/wiki/Doklady_Physics Soviet Physics. Doklady], No. 23
* [[Vladimir Arlazarov]], [[Aaron L. Futer]] ('''1979'''). ''Computer Analysis of a Rook End-Game''. [http://www.doc.ic.ac.uk/~shm/MI/mi9.html Machine Intelligence 9] (eds. [[Jean Hayes Michie]], [[Donald Michie]] and L.I. Mikulich), pp. 361-371. Ellis Horwood, Chichester. Reprinted in [[Computer Chess Compendium]]
==1985 ...==
* [[Jaap van den Herik]], [[Bob Herschberg]] ('''1985'''). ''The Construction of an Omniscient Endgame Data Base''. [[ICGA Journal#8_2|ICCA Journal, Vol. 8, No. 2]]
* [[John Roycroft]] ('''1985'''). ''Chess-Endgame Data-Base`Oracles': Necessary and Desirable Features''. [[ICGA Journal#8_2|ICCA Journal, Vol. 8, No. 2]]
* [[Harry Nefkens]] ('''1985'''). ''Constructing Data Bases to Fit a Microcomputer''. [[ICGA Journal#8_4|ICCA Journal, Vol. 8, No. 4]]
'''1986'''
* [[Jaap van den Herik]], [[Bob Herschberg]] ('''1986'''). ''A Data Base on Data Bases''. [[ICGA Journal#9_1|ICCA Journal, Vol. 9, No. 1]]
* [[John Roycroft]], [[Ken Thompson]] ('''1986'''). ''Queen and Pawn on a2 against Queen''. Chess Endgame Consultants and Publishers, London
* [[John Roycroft]], [[Ken Thompson]] ('''1986'''). ''Queen and Pawn on a6 against Queen''. Chess Endgame Consultants and Publishers, London
* [[John Roycroft]], [[Ken Thompson]] ('''1986'''). ''Queen and Pawn on b7 against Queen''. Chess Endgame Consultants and Publishers, London
* [[Jaap van den Herik]] ('''1986'''). ''Roycroft's 5-Man Chess Endgame Series''. [[ICGA Journal#9_3|ICCA Journal, Vol. 9, No. 3]]
* [[Ken Thompson]] ('''1986'''). ''Retrograde Analysis of Certain Endgames''. [[ICGA Journal#9_3|ICCA Journal, Vol. 9, No. 3]], [http://pdos.csail.mit.edu/~rsc/thompson86endgame.pdf pdf]
* [[Edward Komissarchik]], [[Aaron L. Futer]] ('''1986'''). ''Computer Analysis of a Queen Endgame''. [[ICGA Journal#9_4|ICCA Journal, Vol. 9, No. 4]] <ref>[http://www.mathematik.uni-bielefeld.de/%7Esillke/NEWS/brute-force Subject: brute-force vs. intuition in math & chess] by [https://en.wikipedia.org/wiki/Macsyma Bill Dubuque], August 1996</ref>
* [[Ken Thompson]] ('''1986'''). ''An Example of QPvQ''. [[ICGA Journal#9_4|ICCA Journal, Vol. 9, No. 4]]
* [[Hans Zellner]] ('''1986'''). ''Compressing Databases Down to Micro Size''. [[ICGA Journal#9_4|ICCA Journal, Vol. 9, No. 4]]
'''1987'''
* [[Hans Zellner]] ('''1987'''). ''KBBK Squeezed into a Micro''. [[ICGA Journal#10_1|ICCA Journal, Vol. 10, No. 1]]
* [[Jaap van den Herik]], [[Bob Herschberg]] ('''1987'''). ''The KBBKN Statistics: New Data from Ken Thompson''. [[ICGA Journal#10_1|ICCA Journal, Vol. 10, No. 1]]
* [[Bob Herschberg]], [[Jaap van den Herik]] ('''1987'''). ''More Truth on KBBK Database Results''. [[ICGA Journal#10_2|ICCA Journal, Vol. 10, No. 2]]
* [[Hans Zellner]], [[Jaap van den Herik]], [[Bob Herschberg]] ('''1987'''). ''Corrections and Substantiations to KBNK''. [[ICGA Journal#10_3|ICCA Journal, Vol. 10, No. 3]]
* [[Sito Dekker]], [[Jaap van den Herik]], [[Bob Herschberg]] ('''1987'''). ''Complexity Starts at Five.'' [[ICGA Journal#10_3|ICCA Journal, Vol. 10, No. 3]]
* [[Lars Rasmussen]] ('''1987'''). ''Correcting grandmasters' Analyses in Elementary Endgames''. [[ICGA Journal#10_4|ICCA Journal, Vol. 10, No. 4]]
* [[Jaap van den Herik]], [[Bob Herschberg]], [[Najib Nakad]] ('''1987'''). ''A Six-Men-Endgame Database: KRP(a2)KbBP(a3)''. [[ICGA Journal#10_4|ICCA Journal, Vol. 10, No. 4]], [http://arno.uvt.nl/show.cgi?fid=106791 pdf]
* [[Sito Dekker]], [[Jaap van den Herik]], [[Bob Herschberg]] ('''1987'''). ''Perfect Knowledge and Beyond''. Report 37-87, [[Delft University of Technology]], Delft.
* [[John Roycroft]] ('''1987'''). ''Expert Against Oracle''. [http://www.doc.ic.ac.uk/~shm/MI/mi11.html Machine Intelligence 11]
'''1988'''
* [[Jaap van den Herik]], [[Bob Herschberg]] ('''1988'''). ''Computer Checks on Human Analyses of the KRKB Endgame''. [[ICGA Journal#11_1|ICCA Journal, Vol. 11, No. 1]]
* [[Lars Rasmussen]] ('''1988'''). ''Ultimates in KQKR and KRKN''. [[ICGA Journal#11_1|ICCA Journal, Vol. 11, No. 1]]
* [[Lewis Stiller]] ('''1988'''). ''Massively Parallel Retrograde Endgame Analysis''. BUCS Tech. Report #88-014, Boston University, Computer Science Department.
* [[Jaap van den Herik]], [[Bob Herschberg]], [[Najib Nakad]] ('''1988'''). ''A Reply to R. Sattler's Remarks on the KRP(a2)KbBP(a3) Database''. [[ICGA Journal#11_23|ICCA Journal, Vol. 11, No. 2/3]], [http://arno.uvt.nl/show.cgi?fid=106798 pdf]
* [[Lars Rasmussen]] ('''1988'''). ''A Database for KRKP''. [[ICGA Journal#11_4|ICCA Journal, Vol. 11, No. 4]]
'''1989'''
* [[Christopher A. Marris]] ('''1989'''). ''Compressing a Chess-Endgame Database''. [[ICGA Journal#12_1|ICCA Journal, Vol. 12, No. 1]]
* [[David Forthoffer]], [[Lars Rasmussen]], [[Sito Dekker]] ('''1989'''). ''A Correction to some KRKB-Database Results''. [[ICGA Journal#12_1|ICCA Journal, Vol. 12, No. 1]]
* [https://en.wikipedia.org/wiki/Edmar_Mednis Edmar Mednis] ('''1989'''). ''Rook and Bishop versus Rook: The Controversial Endgame''. [[ICGA Journal#12_1|ICCA Journal, Vol. 12, No. 1]]
* [[Lewis Stiller]] ('''1989'''). ''Parallel Analysis of Certain Endgames''. [[ICGA Journal#12_2|ICCA Journal, Vol. 12, No. 2]]
* [[Hans Zellner]] ('''1989'''). ''The KPK Database Revisited''. [[ICGA Journal#12_2|ICCA Journal, Vol. 12, No. 2]]
* [[Sito Dekker]], [[Jaap van den Herik]], [[Bob Herschberg]] ('''1989'''). ''Perfect Knowledge and Beyond''. [[Advances in Computer Chess 5]]
* [[Bob Herschberg]], [[Jaap van den Herik]], [[Patrick Schoo]] ('''1989'''). ''Verifying and Codifying Strategies in the KNNKP(h) Endgame''. [[ICGA Journal#12_3|ICCA Journal, Vol. 12, No. 3]], [http://arno.uvt.nl/show.cgi?fid=106804 pdf]
* [[Hans Zellner]] ('''1989'''). ''KBBKN on a Micro''. [[ICGA Journal#12_3|ICCA Journal, Vol. 12, No. 3]]
* [[John Roycroft]] ('''1989'''). ''The Computer is at it again - Interfering with the Endgame!'' [https://en.wikipedia.org/wiki/British_Chess_Magazine Britisch Chess Magazine], Vol. 109, No. 10
==1990 ...==
* [[Bob Herschberg]], [[Jaap van den Herik]], [[Patrick Schoo]] ('''1990'''). ''Verifying and Codifying Strategies in a Chess Endgame''. [[Computers, Chess, and Cognition]], pp. 183-196
* [[John Roycroft]] ('''1990'''). ''How to Treat Endgame Databases.'' [[ICGA Journal#13_2|ICCA Journal, Vol. 13, No. 2]]
* [[Ken Thompson]] ('''1990'''). ''KQPKQ and KRPKR Endings''. [[ICGA Journal#13_4|ICCA Journal, Vol. 13, No. 4]]
* [[John Roycroft]] ('''1990'''). ''Identifying Three Types of Zugzwang''. [[ICGA Journal#13_4|ICCA Journal, Vol. 13, No. 4]] » [[Zugzwang]]
'''1991'''
* [[Ken Thompson]] ('''1991'''). ''Chess Endgames Vol. 1.'' [[ICGA Journal#14_1|ICCA Journal, Vol. 14, No. 1]]
* [[Ken Thompson]] ('''1991'''). ''New Results for KNPKB and KNPKN Endgames''. [[ICGA Journal#14_1|ICCA Journal, Vol. 14, No. 1]]
* [https://en.wikipedia.org/wiki/Edmar_Mednis Edmar Mednis] ('''1991'''). ''Database Results for KQKRN and KQKRB annotated''. [[ICGA Journal#14_2|ICCA Journal, Vol. 14, No. 2]]
* [[John Roycroft]] ('''1991'''). ''A Postscript to the Computer's Involvement''. [https://en.wikipedia.org/wiki/British_Chess_Magazine Britisch Chess Magazine], Vol. 111, No. 2
* [[Lewis Stiller]] ('''1991'''). ''Some Results from a Massively Parallel Retrograde Analysis.'' [[ICGA Journal#14_3|ICCA Journal, Vol. 14, No. 3]]
* [[John Roycroft]] ('''1991'''). ''A Side-Effect of new Database Knowledge''. [[ICGA Journal#14_3|ICCA Journal, Vol. 14, No. 3]]
* [[John Roycroft]] ('''1991'''). ''A Use for Endgame Databases?'' [[ICGA Journal#14_4|ICCA Journal, Vol. 14, No. 4]]
* [[John Roycroft]], [[Don Beal]] ('''1991'''). ''To Make Dumb Endgame Databases Speak''. [[Advances in Computer Chess 6]]
'''1992'''
* [[Lewis Stiller]] ('''1992'''). ''KQNKRR''. [[ICGA Journal#15_1|ICCA Journal, Vol. 15, No. 1]]
* [[John Nunn]] ('''1992'''). ''Perfect Prose''. [[ICGA Journal#15_2|ICCA Journal, Vol. 15, No. 2]]
* [[Lars Rasmussen]] ('''1992'''). ''Queen versus Rook and Pawn''. [[ICGA Journal#15_2|ICCA Journal, Vol. 15, No. 2]]
'''1993'''
* [[Burton Wendroff]], [[Tony Warnock]], [[Lewis Stiller]], [[Dean Mayer]], [[Ralph Brickner]] ('''1993'''). ''Bits and pieces: constructing chess endgame databases on parallel and vector architectures''. Appl. Num. Math. 12, pp. 285-295, [http://math.unm.edu/%7Ebbw/endgame.ps.gz zipped ps]
* [[Christian Posthoff]], [[Michael Schlosser]], [[Jens Zeidler]] ('''1993'''). ''Search vs. Knowledge? - Search and Knowledge!'' In: Proc. 3rd KADS Meeting, Munich, March 8-9 1993, Siemens AG, Corporate Research and Development, 305-326, 1993.
* [[John Nunn]] ('''1993'''). ''Extracting Information from Endgame Databases''. [[ICGA Journal#16_4|ICCA Journal, Vol. 16, No. 4]]
'''1994'''
* [[Ingo Althöfer]], [[Bernhard Walter]] ('''1994'''). ''Weak Zugzwang: Statistics on some Chess Endgames''. [[ICGA Journal#17_2|ICCA Journal, Vol. 17, No. 2]]
* [[John Nunn]] ('''1994'''). ''More, and More Perfect Prose''. [[ICGA Journal#17_2|ICCA Journal, Vol. 17, No. 2]]
* [[John Nunn]] ('''1994'''). ''Extracting Information from Endgame Databases''. [[Advances in Computer Chess 7]]
* [[Christian Posthoff]], [[Michael Schlosser]], [[Rainer Staudte]], [[Jens Zeidler]] ('''1994'''). ''Transformations of Knowledge''. [[Advances in Computer Chess 7]]
* [[Grit Lachmann]] ('''1994'''). ''Verarbeitung von Wissen aus Endspieldatenbanken''. Master's thesis, [[Chemnitz University of Technology]] (German)
==1995 ...==
* [[Steven Edwards]] and the Editorial Board ('''1995'''). ''An Examination of the Endgame KBNKN''. [[ICGA Journal#18_3|ICCA Journal, Vol. 18, No. 3]]
* [[Henri Bal]], [[Victor Allis]] ('''1995'''). ''Parallel Retrograde Analysis on a Distributed System''. Supercomputing ’95, San Diego, CA.
'''1996'''
* [[Dietmar Lippold]] ('''1996'''). ''Legality of Positions of Simple Chess Endgames''. [http://digilander.libero.it/gargamellachess/papers/legality%20of%20positions.zip zipped pdf] <ref>[[Jesper Torp Kristensen]] ('''2005'''). ''[http://jespertk.dk/Jesper/public/master_thesis/ Generation and compression of endgame tables in chess with fast random access using OBDDs]''. Master thesis</ref>
* [[Ken Thompson]] ('''1996'''). ''6-Piece Endgames''. [[ICGA Journal#19_4|ICCA Journal, Vol. 19, No. 4]]
* [[Lewis Stiller]] ('''1996'''). ''Multilinear Algebra and Chess Endgames''. [http://library.msri.org/books/Book29/index.html Games of No Chance] edited by [[Richard J. Nowakowski]], [http://www.msri.org/publications/books/Book29/files/stiller.pdf pdf]
'''1997'''
* [[Dietmar Lippold]] ('''1997'''). ''The Legitimacy of Positions in Endgame Databases''. [[ICGA Journal#20_1|ICCA Journal, Vol. 20, No. 1]]
* [[Ken Thompson]] ('''1997'''). ''6-Piece Endgames''. [[Advances in Computer Chess 8]]
* [[Johannes Fürnkranz]] ('''1997'''). ''Knowledge Discovery in Chess Databases: A Research Proposal.'' Technical Report OEFAI-TR-97-33, Austrian Research Institute for Artificial Intelligence, [http://www.ke.informatik.tu-darmstadt.de/%7Ejuffi/publications/chess-ws.ps.gz zipped ps], [http://www.top-5000.nl/ps/Knowledge%20discovery%20in%20chess%20databases%20-%20a%20research%20proposal.pdf pdf] <ref>[https://en.wikipedia.org/wiki/Knowledge_discovery Knowledge discovery from Wikipedia]</ref>
'''1999'''
* [[Ernst A. Heinz]] ('''1999'''). ''Endgame Databases and Efficient Index Schemes for Chess.'' [[ICGA Journal#22_1|ICCA Journal, Vol. 22, No. 1]], [http://people.csail.mit.edu/heinz/ps/edb_index.ps.gz ps]
* [[Ernst A. Heinz]] ('''1999'''). ''Knowledgeable Encoding and Querying of Endgame Databases.'' [[ICGA Journal#22_2|ICCA Journal, Vol. 22, No. 2]], [http://people.csail.mit.edu/heinz/ps/know_edb.ps.gz ps]
* [[Christoph Wirth]], [[Jürg Nievergelt]] ('''1999'''). ''Exhaustive and Heuristic Retrograde Analysis of the KPPKP Endgame.'' [[ICGA Journal#22_2|ICCA Journal, Vol. 22, No. 2]]
* [[Eugene Nalimov]], [[Christoph Wirth]], [[Guy Haworth]] ('''1999'''). ''[http://centaur.reading.ac.uk/4564/ KQQKQQ and the Kasparov-World Game]''. [[ICGA Journal#22_4|ICCA Journal, Vol. 22, No. 4]]
* [[Ulrich Thiemonds]] ('''1999'''). ''Ein regelbasiertes Spielprogramm für Schachendspiele''. [https://en.wikipedia.org/wiki/University_of_Bonn University of Bonn], Diploma thesis, [http://www.iai.uni-bonn.de/~idb/diplomarbeiten/thiemonds99.ps.gz zipped ps] (German)
* [[Chrilly Donninger]] ('''1999'''). ''Der Fortschritt ist nicht aufzuhalten - Chrilly Donninger über Endspieldatenbanken''. [[Computerschach und Spiele|CSS]] 6/99, [http://www.mustrum.de/chrilly/tbs.pdf pdf] (German)
==2000 ...==
* [[Haw-ren Fang]], [[Tsan-sheng Hsu]], [[Shun-Chin Hsu]] ('''2000'''). ''[http://link.springer.com/chapter/10.1007/3-540-45579-5_7 Construction of Chinese Chess Endgame Databases by Retrograde Analysis]''. [[CG 2000]]
* [[Ken Thompson]] ('''2000'''). ''The Longest: KRNKNN in 262''. [[ICGA Journal#23_1|ICGA Journal, Vol. 23, No. 1]]
* [[Peter Karrer]] ('''2000'''). ''KQQKQP and KQPKQP≈''.[[ICGA Journal#23_2|ICGA Journal, Vol. 23, No. 2]] <ref>[https://en.wikipedia.org/wiki/Kasparov_versus_the_World Kasparov versus the World from Wikipedia]</ref>
* [[Guy Haworth]] ('''2000'''). ''Chess Endgames: Currents and Futures''. [[5th Computer Olympiad#Workshop|5th Computer Olympiad Workshop]]
* [[Thomas Lincke]], [[Ambros Marzetta]] ('''2000'''). ''Large Endgame Databases with Limited Memory Space''. [[5th Computer Olympiad#Workshop|5th Computer Olympiad Workshop]]
* [[Thomas Lincke]], [[Ambros Marzetta]] ('''2000'''). ''Large Endgame Databases with Limited Memory Space''. [[ICGA Journal#23_3|ICGA Journal, Vol. 23, No. 3]]
* [[Eugene Nalimov]], [[Guy Haworth]], [[Ernst A. Heinz]] ('''2000'''). ''[http://centaur.reading.ac.uk/4562/ Space-Efficient Indexing of Chess Endgame Tables]''. [[ICGA Journal#23_3|ICGA Journal, Vol. 23, No. 3]], [http://supertech.lcs.mit.edu/%7Eheinz/ps/NHH_ICGA.ps.gz postscript]
'''2001'''
* [[John Tamplin]], [[Guy Haworth]] ('''2001'''). ''[http://centaur.reading.ac.uk/4561/ Ken Thompson's 6-man Tables]''. [[ICGA Journal#24_2|ICGA Journal, Vol. 24, No. 2]]
* [[Harold van der Heijden]] ('''2001'''). ''[http://ilk.uvt.nl/icga/journal/contents/content24-2.htm#ENDGAME%20TABLES Endgame Tables and Endgame Study Composition]''. [[ICGA Journal#24_2|ICGA Journal, Vol. 24, No. 2]]
* [[Noam Elkies]] ('''2001'''). ''Endgame Tables and Chess Composition''. [[ICGA Journal#24_2|ICGA Journal, Vol. 24, No. 2]]
* [[Ren Wu]], [[Don Beal]] ('''2001'''). ''Fast, Memory-efficient Retrograde Algorithms''. [[ICGA Journal#24_3|ICGA Journal, Vol. 24, No. 3]] <ref>[https://www.stmintz.com/ccc/index.php?id=200335 Generating egtbs ICGAJ] by [[Tony van Roon-Werten|Tony Werten]], [[CCC]], December 04, 2001, with reference to [http://www.abc.se/~m10051/eg.txt Computing endgames with few men] by [[Urban Koistinen]]</ref> <ref>[http://www.open-aurec.com/wbforum/viewtopic.php?f=4&t=6302&p=29956 Wu / Beal retrograde analisys algorithm] by [[Alvaro Cardoso|Alvaro Jose Povoa Cardoso]], [[Computer Chess Forums|Winboard Forum]], March 10, 2007</ref>
* [[Ren Wu]], [[Don Beal]] ('''2001'''). ''Parallel Retrograde Analysis on Different Architectures''. IEEE 10th Conference in High Performance Distributed Computing pp. 356-362, August 2001
* [[Eugene Nalimov]], [[Guy Haworth]], [[Ernst A. Heinz]] ('''2001'''). ''[http://centaur.reading.ac.uk/4563/ Space-efficient Indexing of Endgame Tables for Chess]''. [[Advances in Computer Games 9]]
* [[Guy Haworth]] ('''2001'''). ''Four Notes on Chess Endgames''. [[6th Computer Olympiad#Workshop|6th Computer Olympiad Workshop]], [https://ilk.uvt.nl/icga/news/Olympiad/Olympiad/workshop/Haworth.ppt ppt]
: [[Guy Haworth]] ('''2001'''). ''Discarding Like Pieces''. [[6th Computer Olympiad#Workshop|6th Computer Olympiad Workshop]]
: [[Guy Haworth]] ('''2001'''). ''Depth by The Rule''. [[6th Computer Olympiad#Workshop|6th Computer Olympiad Workshop]]
: [[Guy Haworth]] ('''2001'''). ''[http://centaur.reading.ac.uk/5949/ 3-5-Man Chess Data]''. [[6th Computer Olympiad#Workshop|6th Computer Olympiad Workshop]]
: [[Guy Haworth]] ('''2001'''). ''[http://centaur.reading.ac.uk/5950/ 3-5-Man Mutual Zugzwangs in Chess]''. [[6th Computer Olympiad#Workshop|6th Computer Olympiad Workshop]]
* [[Guy Haworth]] ('''2001'''). ''[http://centaur.reading.ac.uk/4594/ Discarding Like Pieces]''. [[ICGA Journal#24_3|ICGA Journal, Vol. 24, No. 3]]
* [[Guy Haworth]] ('''2001'''). ''[http://centaur.reading.ac.uk/4593/ Depth by The Rule]''. [[ICGA Journal#24_3|ICGA Journal, Vol. 24, No. 3]]
* [[Guy Haworth]], [[Peter Karrer]], [[John Tamplin]], [[Christoph Wirth]] ('''2001'''). ''[http://centaur.reading.ac.uk/4581/ 3-5-man chess: Maximals and mzugs]''. [[ICGA Journal#24_4|ICGA Journal, Vol. 24, No. 4]]
'''2002'''
* [[Guy Haworth]] ('''2002'''). ''[http://centaur.reading.ac.uk/4552/ Secrets of Pawnless Endings]''. [[ICGA Journal#25_2|ICGA Journal, Vol. 25, No. 2]]
* [[Eugène Nalimov]] ('''2002'''). ''Chess Endgame Tablebases''. Invited Lecture, [[7th Computer Olympiad#Workshop|7th Computer Olympiad Workshop]]
* [[Guy Haworth]] ('''2002'''). ''Reference Fallible Endgame Play''. [[7th Computer Olympiad#Workshop|7th Computer Olympiad Workshop]], [http://centaur.reading.ac.uk/4579/1/2002c_CoW7_H_Reference_Fallible_Endgame_Play.pdf pdf]
* [[Ren Wu]], [[Don Beal]] ('''2002'''). ''A memory efficient retrograde algorithm and its application to solve Chinese Chess endgames.'' [http://library.msri.org/books/Book42/ More Games of No Chance] edited by [[Richard J. Nowakowski]]
'''2003'''
* [[John Tamplin]], [[Guy Haworth]] ('''2003'''). ''[http://centaur.reading.ac.uk/4547/ Chess Endgames: Data and Strategy]''. [[Advances in Computer Games 10]]
* [[Guy Haworth]], [[Rafael B. Andrist]] ('''2003'''). ''[http://centaur.reading.ac.uk/4548/ Model Endgame Analysis]''. [[Advances in Computer Games 10]]
* [[Jonathan Schaeffer]], [[Yngvi Björnsson]], [[Neil Burch]], [[Rob Lake]], [[Paul Lu]], [[Steve Sutphen]] ('''2003'''). ''Building the Checkers 10-Piece Endgame Databases.'' [[Advances in Computer Games 10]]. [http://webdocs.cs.ualberta.ca/%7Ejonathan/Grad/Papers/databases10.pdf pdf] » [[Checkers]]
* [[Guy Haworth]] ('''2003'''). ''[http://centaur.reading.ac.uk/4550/ Reference Fallible Endgame Play]''. [[ICGA Journal#26_2|ICGA Journal, Vol. 26, No. 2]]
* [[Ed Trice]], [[Gil Dodgen]] ('''2003'''). ''[http://ilk.uvt.nl/icga/journal/contents/content26-4.htm#7%20piece The Perfect 7-Piece Checkers Database]''. [[ICGA Journal#26_4|ICGA Journal, Vol. 26, No. 4]] » [[Checkers]]
'''2004'''
* [[Haw-ren Fang]] ('''2004'''). ''[http://link.springer.com/chapter/10.1007/11674399_9 Rule-Tolerant Verification Algorithms for Completeness of Chinese-Chess Endgame Databases]''. [[CG 2004]]
* [[Eiko Bleicher]] ('''2004'''). ''Building Chess Endgame Databases for Positions with many Pieces using A-priori Information''. Lehrstuhl Mathematische Optimierung, [http://www.minet.uni-jena.de/ Fakultät für Mathematik und Informatik], [https://en.wikipedia.org/wiki/University_of_Jena Friedrich-Schiller-Universität, Jena], Germany, as [http://www.minet.uni-jena.de/preprints/bleicher_04/FREEZER_.PDF pdf]
==2005 ...==
* [[Joe Leslie-Hurd|Joe Hurd]] ('''2005'''). ''Formal Verification of Chess Endgame Databases''. in [[Joe Leslie-Hurd|Joe Hurd]], Edward Smith, [http://www.informatik.uni-trier.de/~ley/pers/hd/d/Darbari:Ashish Ashish Darbari] ''Theorem proving in higher order logics: Emerging trends proceedings''. Technical Report PRG-RR-05-02, [http://de.wikipedia.org/wiki/University_of_Oxford Oxford University] Computing Laboratory, [http://www.gilith.com/research/papers/chess.pdf pdf]
* [[Jesper Torp Kristensen]] ('''2005'''). ''[http://jespertk.dk/Jesper/public/master_thesis/ Generation and compression of endgame tables in chess with fast random access using OBDDs]''. Master thesis, Supervisor [[Mathematician#Miltersen|Peter Bro Miltersen]], [https://en.wikipedia.org/wiki/Aarhus_University Aarhus University], [http://jespertk.dk/Jesper/public/master_thesis/report/report.pdf pdf] <ref>[https://en.wikipedia.org/wiki/Binary_decision_diagram OBDD - Ordered Binary Decision Diagram from Wikipedia]</ref>
* [[Guy Haworth]] ('''2005'''). ''[http://centaur.reading.ac.uk/4522/ 6-Man Chess Solved]''. [[ICGA Journal#28_3|ICGA Journal, Vol. 28, No. 3]]
* [[Marc Bourzutschky]], [[John Tamplin]], [[Guy Haworth]] ('''2005'''). ''[http://centaur.reading.ac.uk/4524/ Chess endgames: 6-man data and strategy]''. Theoretical Computer Science, Vol. 349, No. 2
* [[Rafael B. Andrist]], [[Guy Haworth]] ('''2005'''). ''[http://centaur.reading.ac.uk/4523/ Deeper model endgame analysis]''. Theoretical Computer Science, Vol. 349, No. 2
* [[Guy Haworth]] ('''2005'''). ''[http://centaur.reading.ac.uk/4610/ Chess Endgame News]''. [[ICGA Journal#28_4|ICGA Journal, Vol. 28, No. 4]]
* [[Yngvi Björnsson]], [[Jonathan Schaeffer]], [[Nathan Sturtevant]] ('''2005'''). ''[http://link.springer.com/chapter/10.1007/11922155_2 Partial Information Endgame Databases]''. [[Advances in Computer Games 11]], [http://webdocs.cs.ualberta.ca/~nathanst/papers/partialEndgameDatabases.pdf pdf], [http://www.ru.is/faculty/yngvi/pdf/BjornssonSS06.pdf pdf]
'''2006'''
* [[Guy Haworth]] ('''2006'''). ''[http://centaur.reading.ac.uk/4609/ Chess Endgame News]''. [[ICGA Journal#29_1|ICGA Journal, Vol. 29, No. 1]]
* [[Guy Haworth]] ('''2006'''). ''[http://centaur.reading.ac.uk/4608/ Chess Endgame News]''. [[ICGA Journal#29_2|ICGA Journal, Vol. 29, No. 2]]
* [[Guy Haworth]] ('''2006'''). ''[http://centaur.reading.ac.uk/4520/ Chess Endgame News]''. [[ICGA Journal#29_3|ICGA Journal, Vol. 29, No. 3]]
'''2008'''
* [[Bo-Nian Chen]], [[Pangfeng Liu]], [[Shun-Chin Hsu]], [[Tsan-sheng Hsu]] ('''2008'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-87608-3_17 Knowledge Inferencing on Chinese Chess Endgames]''. [[CG 2008]]
'''2009'''
* [[Guy Haworth]] ('''2009'''). ''[http://centaur.reading.ac.uk/5763/ Chess Endgame Update]''. [[ICGA Journal#32_4|ICGA Journal, Vol. 32, No. 4]]
==2010 ...==
* [[Bo-Nian Chen]], [[Pangfeng Liu]], [[Shun-Chin Hsu]], [[Tsan-sheng Hsu]] ('''2010'''). ''Conflict Resolution of Chinese Chess Endgame Knowledge Base''. [[Advances in Computer Games 12]], [http://ticc.uvt.nl/icga/acg12/proceedings/Contribution108.pdf pdf]
* [[Joe Leslie-Hurd|Joe Hurd]], [[Guy Haworth]] ('''2010'''). ''[http://link.springer.com/chapter/10.1007%2F978-3-642-12993-3_20 Data Assurance in Opaque Computations]''. [[Advances in Computer Games 12]], [http://www.gilith.com/research/papers/egt.pdf pdf]
* [[Matej Guid]], [[Martin Možina]], [[Aleksander Sadikov]], [[Ivan Bratko]] ('''2010'''). ''[http://www.springerlink.com/content/um0l155681087p7h Deriving Concepts and Strategies from Chess Tablebases]''. [[Advances in Computer Games 12]], [http://www.ailab.si/matej/doc/Deriving_Concepts_and_Strategies_from_Chess_Tablebases.pdf pdf]
* [[Eiko Bleicher]], [[Guy Haworth]] ('''2010'''). ''[http://centaur.reading.ac.uk/4518/ 6-Man Chess and Zugzwangs]''. [[Advances in Computer Games 12]]
* [[Bo-Nian Chen]], [[Pangfeng Liu]], [[Shun-Chin Hsu]], [[Tsan-sheng Hsu]] ('''2010'''). ''[http://www.springerlink.com/content/6374711454584j73/ Knowledge Abstraction in Chinese Chess Endgame Databases]''. [[CG 2010]]
* [[Ping-hsun Wu]], [[Ping-yi Liu]], [[Tsan-sheng Hsu]] ('''2010'''). ''An External-memory Retrograde Analysis Algorithm'', slides as [http://www.iis.sinica.edu.tw/~tshsu/tcg2010/slides/slide12.pdf pdf]
* [[Eiko Bleicher]], [[Guy Haworth]], [[Harold van der Heijden]] ('''2010'''). ''[http://centaur.reading.ac.uk/17497/ Data-Mining Chess Databases]''. [[ICGA Journal#33_4|ICGA Journal, Vol. 33, No. 4]]
'''2011'''
* [[Guy Haworth]] ('''2011'''). ''Chess Endgame News''. [[ICGA Journal#34_2|ICGA Journal, Vol. 34, No. 2]]
'''2013'''
* [[Guy Haworth]] ('''2013'''). ''Chess Endgame News''. [[ICGA Journal#36_1|ICGA Journal, Vol. 36, No. 1]]
* [[Guy Haworth]] ('''2013'''). ''Chess Endgame News''. [[ICGA Journal#36_2|ICGA Journal, Vol. 36, No. 2]]
* [[Abdallah Saffidine]], [[Nicolas Jouandeau]], [[Cédric Buron]], [[Tristan Cazenave]] ('''2013'''). ''Material Symmetry to Partition Endgame Tables''. [[CG 2013]]
* [[John Nunn]] ('''2013'''). ''Discoveries in R+2P vs. R+P Endings''. [[ICGA Journal#36_3|ICGA Journal, Vol. 36, No. 3]]
* [[Guy Haworth]] ('''2013'''). ''Chess Endgame News''. [[ICGA Journal#36_3|ICGA Journal, Vol. 36, No. 3]]
* [[Karsten Müller]], [[Guy Haworth]] ('''2013'''). ''Rook vs. Bishop''. [[ICGA Journal#36_4|ICGA Journal, Vol. 36, No. 4]]
* [[Bo-Nian Chen]], [[Hung-Jui Chang]], [[Shun-Chin Hsu]], [[Jr-Chang Chen]], [[Tsan-sheng Hsu]] ('''2013'''). ''Multilevel Inference in Chinese Chess Endgame Knowledge Bases''. [[ICGA Journal#36_4|ICGA Journal, Vol. 36, No. 4]] » [[Chinese Chess]]
* [[Guy Haworth]] ('''2013'''). ''Chess Endgame News''. [[ICGA Journal#36_4|ICGA Journal, Vol. 36, No. 4]]
* [[Guy Haworth]] ('''2013'''). ''Haworth’s Law''. [[ICGA Journal#36_4|ICGA Journal, Vol. 36, No. 4]]
* [[Victor Zakharov]], [[Vladimir Makhnychev]] ('''2013'''). ''Creating tables of chess 7-piece endgames on the Lomonosov supercomputer''. Superkomp’yutery, No. 15
'''2014'''
* [[Bo-Nian Chen]], [[Hung-Jui Chang]], [[Shun-Chin Hsu]], [[Jr-Chang Chen]], [[Tsan-sheng Hsu]] ('''2014'''). ''Advanced Meta-knowledge for Chinese Chess Endgame Knowledge Bases''. [[ICGA Journal#37_1|ICGA Journal, Vol 37, No. 1]] » [[Chinese Chess]]
* [[Guy Haworth]] ('''2014'''). ''Chess Endgame News''. [[ICGA Journal#37_1|ICGA Journal, Vol. 37, No. 1]] » [[Syzygy Bases]]
* [[Guy Haworth]] ('''2014'''). ''Chess Endgame News''. [[ICGA Journal#37_2|ICGA Journal, Vol. 37, No. 2]] » [[Syzygy Bases]]
* [[Guy Haworth]] ('''2014'''). ''Chess Endgame News''. [[ICGA Journal#37_3|ICGA Journal, Vol. 37, No. 3]] » [[Syzygy Bases]]
==2015 ...==
* [[Nikolaos Papahristou]], [[Ioannis Refanidis]] ('''2015'''). ''Constructing Pin Endgame Databases for the Backgammon Variant Plakoto''. [[Advances in Computer Games 14]] <ref>[https://en.wikipedia.org/wiki/Plakoto Plakoto from Wikipedia]</ref>
* [[Guy Haworth]] ('''2015'''). ''Chess Endgame News''. [[ICGA Journal#38_1|ICGA Journal, Vol. 38, No. 1]] » [[Crafty]], [[FinalGen]]
* [[Galen Huntington]], [[Guy Haworth]] ('''2015'''). ''Depth to Mate and the 50-Move Rule''. [[ICGA Journal#38_2|ICGA Journal, Vol. 38, No. 2]] » [[Fifty-move Rule|Fifty-Move Rule]] <ref>[http://galen.metapath.org/egtb50/ Endgame tablebases with the fifty-move rule] by [[Galen Huntington]]</ref>
* [[Michael Hartisch]], [[Ingo Althöfer]] ('''2015'''). ''Optimal Robot Play in Certain Chess Endgame Situations''. [[ICGA Journal#38_3|ICGA Journal, Vol. 38, No. 3]]
'''2016'''
* [[Victor Zakharov]], [[Michael G. Malkovsky]], [[Vladislav Y. Shchukin]] ('''2016'''). ''[http://link.springer.com/article/10.3103%2FS0278641916010076 Compression of underdetermined data in a 7-piece chess table]''. [http://www.springer.com/mathematics/journal/11968 Moscow University Computational Mathematics and Cybernetics], Vol. 40, No. 1 <ref>[http://www.talkchess.com/forum/viewtopic.php?t=60222 tablebase compression / academic integrity] by [[Ronald de Man]], [[CCC]], May 19, 2016</ref>
'''2017'''
* [[Karsten Müller]] ('''2017'''). ''Tablebases, Fermat, Knights and Knightmares''. [[ICGA Journal#39_2|ICGA Journal, Vol. 39, No. 2]]
* [[Guy Haworth]] ('''2017'''). ''Chess Endgame News''. [[ICGA Journal#39_2|ICGA Journal, Vol. 39, No. 2]]
=Forum Posts=
==1995 ...==
* [https://groups.google.com/d/msg/rec.games.chess/DBNZkyTtSUQ/PVd9C3UGXpwJ endgame databases and Kasparov] by [[Feng-Hsiung Hsu]], [[Computer Chess Forums|rgc]], April 25, 1995
* [http://groups.google.com/group/rec.games.chess.computer/browse_frm/thread/39b9eb099ae1a5e9 Tablebases and castling?] by [[Ronald de Man]], [[Computer Chess Forums|rgcc]], May 12, 1997
* [https://www.stmintz.com/ccc/index.php?id=11493 Steve Edward's Endgame Tablebase generator is now available for WIN95] by [[Michael Byrne|Mike Byrne]], [[CCC]], November 01, 1997
* [https://groups.google.com/d/msg/rec.games.chess.computer/X7QO1spJ4SE/pLsSj0nlFAoJ Questions about Endgame tablebases] by Alexander Nitschke, [[Computer Chess Forums|rgcc]], March 19, 1998
* [https://www.stmintz.com/ccc/index.php?id=25540 Tablebases] by [[Eugene Nalimov]], [[CCC]], August 28, 1998 » [[Nalimov Tablebases]]
* [https://www.stmintz.com/ccc/index.php?id=25755 Ideas to reduce size of tablebases] by [[Rémi Coulom]], [[CCC]], August 31, 1998
* [http://groups.google.com/group/rec.games.chess.computer/browse_frm/thread/88d16e7b3ad524f1 endgame databases] by [[Robert Hyatt]], [[Computer Chess Forums|rgcc]], October 13, 1998
* [https://www.stmintz.com/ccc/index.php?id=42184 Interesting endgame database probe problem] by [[Robert Hyatt]], [[CCC]], February 04, 1999
: [https://www.stmintz.com/ccc/index.php?id=42763 overlapping tablebase lookup] by [[Jay Scott]], [[CCC]], February 09, 1999
==2000 ...==
* [https://www.stmintz.com/ccc/index.php?id=107902 Tablebase Access Code] by [[Roberto Waldteufel]], [[CCC]], April 26, 2000 » [[Rabbit]]
* [https://www.stmintz.com/ccc/index.php?id=162252 EGTB: Better algorithm] by [[Urban Koistinen]], [[CCC]], April 07, 2001 <ref>[http://www.abc.se/~m10051/eg.txt Computing endgames with few men] by [[Urban Koistinen]]</ref>
* [http://groups.google.com/group/rec.games.chess.computer/msg/392bcd5797808c0e Re: How endgame tablebases work] by [[Bruce Moreland]], [[Computer Chess Forums|rgcc]], July 19, 2001
* [https://www.stmintz.com/ccc/index.php?id=181281 PONDER=ON and TableBases on 1 PC] by [[Matthias Gemuh]], [[CCC]], July 27, 2001 » [[Pondering]]
* [https://www.stmintz.com/ccc/index.php?id=192968 Nalimov's EGTBs (long post with code)] by [[Heiner Marxen]], [[CCC]], October 13, 2001
* [https://www.stmintz.com/ccc/index.php?id=195809 Incomplete egtbs can be harmful] by [[Leen Ammeraal]], [[CCC]], November 06, 2001
* [https://www.stmintz.com/ccc/index.php?id=200335 Generating egtbs ICGAJ] by [[Tony van Roon-Werten|Tony Werten]], [[CCC]], December 04, 2001 <ref>[[Ren Wu]], [[Don Beal]] ('''2001'''). ''Fast, Memory-efficient Retrograde Algorithms''. [[ICGA Journal#24_3|ICGA Journal, Vol. 24, No. 3]]</ref> <ref>[http://www.abc.se/~m10051/eg.txt Computing endgames with few men] by [[Urban Koistinen]]</ref>
: [https://www.stmintz.com/ccc/index.php?id=200376 Wu/Beal predates Koistinen] by [[Guy Haworth]], [[CCC]], December 04, 2001
* [https://www.stmintz.com/ccc/index.php?id=203322 3-3 tablebase (with pawns) suggestion] by [[Shane Hudson]], [[CCC]], December 23, 2001
* [https://www.stmintz.com/ccc/index.php?id=224008 Interesting EGTB bug] by [[Tom Likens]], [[CCC]], April 16, 2002
* [https://www.stmintz.com/ccc/index.php?id=287563 How to handle EGTB stalemates] by [[Tom Likens]], [[CCC]], March 02, 2003 » [[Stalemate]]
* [https://www.stmintz.com/ccc/index.php?id=290629 EGTB generation with 1 bit per position?] by [[Martin Fierz]], [[CCC]], March 25, 2003
* [https://www.stmintz.com/ccc/index.php?id=316547 Frank Phillips' KNNKP position revisited ...] by [[Guy Haworth]], [[CCC]], September 18, 2003 <ref>[https://www.stmintz.com/ccc/index.php?id=315666 Easy mate] by [[Frank Phillips]], [[CCC]], September 13, 2003 » [[Checkmate]]</ref>
==2005 ...==
* [http://www.open-aurec.com/wbforum/viewtopic.php?f=4&t=4118 EGTB question] by [[Stef Luijten]], [[Computer Chess Forums|Winboard Forum]], January 09, 2006
* [http://www.open-aurec.com/wbforum/viewtopic.php?f=4&t=4307 EGTB compression] by [[Stef Luijten]], [[Computer Chess Forums|Winboard Forum]], February 10, 2006
* [http://kirill-kryukov.com/chess/discussion-board/viewtopic.php?f=6&t=2759 utility for testing tablebases integrity] by [[Victor Zakharov]], [[Computer Chess Forums|CCRL Discussion Board]], October 24, 2007
* [http://www.talkchess.com/forum/viewtopic.php?t=19178 EGTB compression (H. G. Muller tablebase...)] by [[Dann Corbit]], [[CCC]], January 25, 2008
* [http://kirill-kryukov.com/chess/discussion-board/viewtopic.php?f=6&t=3934 DTR is no good!] by [[Harm Geert Muller]], [[Computer Chess Forums|CCRL Discussion Board]], September 24, 2008
* [http://www.talkchess.com/forum/viewtopic.php?t=25311 Gaviota's Endgame Tablebases] by [[Miguel A. Ballicora]], [[CCC]], December 07, 2008 » [[Gaviota Tablebases]]
* [http://www.talkchess.com/forum/viewtopic.php?t=25546 Creating EGTBs] by [[Carey Bloodworth|Carey]], [[CCC]], December 21, 2008
* [http://www.talkchess.com/forum/viewtopic.php?t=26184 Other endgame tablebase generators] by [[Denis Mendoza|Denis P. Mendoza]], [[CCC]], January 23, 2009
==2010 ...==
* [http://www.open-chess.org/viewtopic.php?f=3&t=778 Some tablebase formats] by [[Mark Watkins|BB+]], [[Computer Chess Forums|OpenChess Forum]], November 25, 2010
* [http://www.open-chess.org/viewtopic.php?f=5&t=779 Retrograde tablebase methods] by [[Mark Watkins|BB+]], [[Computer Chess Forums|OpenChess Forum]], November 26, 2010
'''2011'''
* [http://www.talkchess.com/forum/viewtopic.php?t=38372 Gaviota tablebases, probing code v4 (UPDATE)] by [[Miguel A. Ballicora]], [[CCC]], March 11, 2011
* [http://www.open-chess.org/viewtopic.php?f=5&t=1364 Large tablebases] by [[Mark Watkins|BB+]], [[Computer Chess Forums|OpenChess Forum]], April 21, 2011
* [http://kirill-kryukov.com/chess/discussion-board/viewtopic.php?f=6&t=6142 Mapping the 7-men computation] by Astokes, [[Computer Chess Forums|CCRL Discussion Board]], September 21, 2011
* [http://www.talkchess.com/forum/viewtopic.php?t=41435 Poor Man Table Base] by [[Ed Schroder]], [[CCC]], December 13, 2011
* [http://www.talkchess.com/forum/viewtopic.php?t=41467 Number sequence puzzle] by [[Steven Edwards]], [[CCC]], December 16, 2011 <ref>[http://oeis.org/A018214 A018214 - OEIS | Alkane (or paraffin) numbers]</ref>
* [http://www.talkchess.com/forum/viewtopic.php?t=41524 Tablebase class name list available] by [[Steven Edwards]], [[CCC]], December 19, 2011 » [[CookieCat]]
'''2012'''
* [http://www.talkchess.com/forum/viewtopic.php?t=44347 Compression of chess databases] by [[Edmund Moshammer]], [[CCC]], July 09, 2012
* [http://www.talkchess.com/forum/viewtopic.php?t=44553 pawn enumeration] by [[Daniel Shawul]], [[CCC]], July 24, 2012
'''2013'''
* [http://www.talkchess.com/forum/viewtopic.php?t=47681 New 6-piece tablebases] by [[Ronald de Man]], [[CCC]], April 01, 2013 » [[Syzygy Bases]]
* [http://www.talkchess.com/forum/viewtopic.php?t=47768 Complete 7-piece tablebases are out!] by [[Albert Silver]], [[CCC]], April 12, 2013 <ref>[http://chessok.com/?page_id=27966 Lomonosov Endgame Tablebases] - [[ChessOK]]</ref>
* [http://www.talkchess.com/forum/viewtopic.php?t=49592 Multithreaded LRU] by [[Alvaro Cardoso]], [[CCC]], October 06, 2013 » [[Memory]]
* [http://www.talkchess.com/forum/viewtopic.php?t=49684 What happens using egbb] by [[Kai Laskos]], [[CCC]], October 12, 2013 » [[Scorpio Bitbases]]
* [http://www.talkchess.com/forum/viewtopic.php?t=49702 tablebase caching / mmap() / page cache] by [[Ronald de Man]], [[CCC]], October 13, 2013 » [[Memory]], [[Syzygy Bases]]
* [http://rybkaforum.net/cgi-bin/rybkaforum/topic_show.pl?tid=27815 How to encode endgame tablebases] by Mr. beo, [[Computer Chess Forums|Rybka Forum]], October 18, 2013
* [http://www.talkchess.com/forum/viewtopic.php?t=49805 Could EGTB make an Engine "weaker"?] by Bill Henry, [[CCC]], October 23, 2013
* [http://www.talkchess.com/forum/viewtopic.php?t=50194 evaluating tablebases draws] by [[Uri Blass]], [[CCC]], November 23, 2013 » [[Draw Evaluation]]
* [http://www.talkchess.com/forum/viewtopic.php?t=50334 Table Base Cache Size question] by Rob Nicholas, [[CCC]], December 05, 2013 » [[Memory]]
'''2014'''
* [http://www.talkchess.com/forum/viewtopic.php?t=50894 Scorpio 6men EGBB Now available] by [[Joshua Shriver]], [[CCC]], January 14, 2014 » [[Scorpio Bitbases]]
* [http://www.talkchess.com/forum/viewtopic.php?t=50962 On-demand tablebase generation] by [[Evert Glebbeek]], [[CCC]], January 19, 2014
* [http://www.talkchess.com/forum/viewtopic.php?t=51847 Endgame tablebase generation for newbies] by [[Alberto Sanjuan]], [[CCC]], April 04, 2014
* [http://www.talkchess.com/forum/viewtopic.php?t=53244 A different tablebase encoding format] by [[Steven Edwards]], [[CCC]], August 10, 2014
* [http://www.talkchess.com/forum/viewtopic.php?t=54064 Tablebase access using a Solid State Disk] by [[Steven Edwards]], [[CCC]], October 16, 2014 » [[Memory]]
==2015 ...==
* [http://www.talkchess.com/forum/viewtopic.php?t=56363 how to probe egtb from console?] by [[Marco Belli]], [[CCC]], May 15, 2015 » [[CLI]]
* [http://www.talkchess.com/forum/viewtopic.php?t=57517 Yet another KPK endgame table generator: pfkpk] by [[Marcel van Kervinck]], [[CCC]], September 05, 2015 » [[KPK]] [[Endgame Bitbases|Bitbase]] <ref>[https://github.com/kervinck/pfkpk kervinck/pfkpk · GitHub]</ref>
* [http://www.talkchess.com/forum/viewtopic.php?t=57331 Is there tools to get the longest DTM/DTC for elementary EG?] by [[Vincent Lejeune]], [[CCC]], September 07, 2015
* [http://www.talkchess.com/forum/viewtopic.php?t=57539 7 men Rook endgames H4 vs SF in recent TCEC stage 1b] by Nay Lin Tun, [[CCC]], September 07, 2015 » [[Rook Endgame]], [[TCEC Season 8]]
'''2016'''
* [http://www.talkchess.com/forum/viewtopic.php?t=59237 Nalimov EGTB problem related to DTM?] by [[Kai Laskos]], [[CCC]], February 14, 2016 » [[Nalimov Tablebases]], [[Endgame Tablebases#DTM|DTM]]
: [http://www.talkchess.com/forum/viewtopic.php?t=59237&start=7 Re: Nalimov EGTB problem related to DTM?] by [[Ronald de Man]], [[CCC]], February 14, 2016
* [http://www.talkchess.com/forum/viewtopic.php?t=59422 6-men tablebase wanted] by [[Harm Geert Muller]], [[CCC]], March 03, 2016
* [http://www.talkchess.com/forum/viewtopic.php?t=60169 Good testsets for tablebases testing] by [[Sergei Markoff|Sergei S. Markoff]], [[CCC]], May 15, 2016 » [[Test-Positions]]
: [http://www.talkchess.com/forum/viewtopic.php?t=60244 EPD to test EGTB probe code] by [[Sergei Markoff|Sergei S. Markoff]], [[CCC]], May 24, 2016
* [http://www.talkchess.com/forum/viewtopic.php?t=60255 11-men tablebases (XQ)] by [[Harm Geert Muller]], [[CCC]], May 23, 2016 » [[Chinese Chess|Xiangqi]]
* [http://www.talkchess.com/forum/viewtopic.php?t=60312 Natural TB] by [[Marco Costalba]], [[CCC]], May 29, 2016 » [[Syzygy Bases]], [[Stockfish]]
* [http://www.talkchess.com/forum/viewtopic.php?t=60833 How texel probes endgame tablebases] by [[Peter Österlund]], [[CCC]], July 16, 2016 » [[Gaviota Tablebases]], [[Syzygy Bases]], [[Texel]]
* [http://www.talkchess.com/forum/viewtopic.php?t=60873 Getting engines to use TBs in Arena] by [[Brendan J. Norman]], [[CCC]], July 19, 2016 » [[Arena]]
* [http://www.talkchess.com/forum/viewtopic.php?t=60906 Syzygy and draw by repetition] by [[Jon Dart]], [[CCC]], July 22, 2016 » [[Draw]], [[Repetitions]], [[Syzygy Bases]]
* [http://www.talkchess.com/forum/viewtopic.php?t=60918 Verifiability of endgame tablebases] by Joan Charmant, [[CCC]], July 23, 2016
'''2017'''
* [http://www.talkchess.com/forum/viewtopic.php?t=63153 Checkers Is Strongly-Solved for 8-pieces] by [[Ed Trice]], [[CCC]], February 12, 2017 » [[Checkers]]
* [http://www.talkchess.com/forum/viewtopic.php?t=63314 Search Halting Criteria When Probing Tablebases] by [[Ed Trice]], [[CCC]], March 02, 2017
* [http://www.talkchess.com/forum/viewtopic.php?t=64030 Probe EGT in quiescence?] by [[Pham Hong Nguyen|Nguyen Pham]], [[CCC]], May 20, 2017 » [[Quiescence Search]], [[Chinese Chess|Xiangqi]]
* [http://www.talkchess.com/forum/viewtopic.php?t=64059 Incorporating Endgame tablebases] by Pranav Deshpande, [[CCC]], May 24, 2017
* [http://www.talkchess.com/forum/viewtopic.php?t=64767 EGTB probe in search] by [[Erin Dame]], [[CCC]], July 30, 2017
* [http://www.talkchess.com/forum/viewtopic.php?t=60312&start=240 Natural TB (take 2)] by [[Marco Costalba]], [[CCC]], August 22, 2017 » [[Syzygy Bases]], [[Stockfish]]
* [http://www.talkchess.com/forum/viewtopic.php?t=65390 understanding DTZ] by [[Alexandru Mosoi]], [[CCC]], October 06, 2017 » [[Endgame Tablebases#DTZ|DTZ]], [[Syzygy Bases]], [[Syzygy Bases#Fathom|Fathom]]
'''2018'''
* [http://www.talkchess.com/forum/viewtopic.php?t=66337 A new design for Xianqgi (Chinese chess) Endgame Tablebase] by [[Pham Hong Nguyen|Nguyen Pham]], [[CCC]], January 16, 2018 » [[Chinese Chess]]
* [http://www.talkchess.com/forum/viewtopic.php?t=66423 Question about EGT formats] by [[Harm Geert Muller]], [[CCC]], January 26, 2018
* [http://www.talkchess.com/forum/viewtopic.php?t=66754 The history of Syzygy tablebases] by Isaac Haïk Dunn, [[CCC]], March 06, 2018 » [[Syzygy Bases]]
=External Links=
* [[ICGA#Topics]]: [http://ilk.uvt.nl/icga/games/chess/endgames.php Chess Endgames] compiled by [[Guy Haworth]] and colleagues
* [https://en.wikipedia.org/wiki/Endgame_tablebase Endgame tablebase from Wikipedia]
* [http://computer-chess.org/doku.php?id=computer_chess:wiki:lists:egtbs_list Endgame Tablebases and Bitbases List] from [http://computer-chess.org/doku.php?id=home Computer-Chess Wiki] by [[Ron Murawski]]
* [http://quux.org:70/Archives/usenet-a-news/NET.chess/82.01.07_sri-unix.458_net.chess.txt QUEEN vs. ROOK] by [http://www.highbeam.com/doc/1G1-62632443.html Warren Stenberg] and Edware J. Conway, reprinted from the January, 1979 issue of the Minnesota Chess Journal, The Usenet Oldnews Archive, Compilation Copyright (C) 1981, 1996 Bruce Jones, Henry Spencer, David Wiseman » [[ACM 1978]], [[Belle]], [https://en.wikipedia.org/wiki/Walter_Browne Walter Browne]
* [http://www.gilith.com/chess/endgames/ Gilith - Chess Endgames] by [[Joe Leslie-Hurd]]
* [http://sites.google.com/site/gaviotachessengine/Home/endgame-tablebases-1 Endgame Tablebases - gaviota chess engine] by [[Miguel A. Ballicora]] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=38372 Gaviota tablebases, probing code v4 (UPDATE)] by [[Miguel A. Ballicora]], [[CCC]], March 11, 2011</ref>
: [http://sites.google.com/site/gaviotachessengine/schemes Compression Schemes for Gaviota Tablebases]
* [http://www.abc.se/~m10051/eg.txt Computing endgames with few men] by [[Urban Koistinen]] <ref>[https://www.stmintz.com/ccc/index.php?id=162252 EGTB: Better algorithm] by [[Urban Koistinen]], [[CCC]], April 07, 2001</ref> <ref>[https://www.stmintz.com/ccc/index.php?id=200335 Generating egtbs ICGAJ] by [[Tony van Roon-Werten|Tony Werten]], [[CCC]], December 04, 2001</ref> <ref>[[Ren Wu]], [[Don Beal]] ('''2001'''). ''Fast, Memory-efficient Retrograde Algorithms''. [[ICGA Journal#24_3|ICGA Journal, Vol. 24, No. 3]]</ref>
* [https://github.com/Koistinen/Endgame Koistinen/Endgame · GitHub]
* [http://home.hccnet.nl/h.g.muller/EGTB.html End-Game Table Bases] by [[Harm Geert Muller]]
* [http://home.hccnet.nl/h.g.muller/EGT7/7-men.html The Leapfrog Tablebase Generator] by [[Harm Geert Muller]]
* [http://www.freesoft.org/software/hoffman/ Hoffman] by [[Brent Baccala]]
* [http://www.vlasak.biz/tablebase.htm Endgame databases] by [[Emil Vlasák]]
* [http://kirill-kryukov.com/chess/discussion-board/viewforum.php?f=6 CCRL Discussion Board - Endgame Tablebases]
* [http://www.horizonchess.com/FAQ/Winboard/egtb.html Guide to the use of Computer Chess Endgame Tablebases] from [http://www.horizonchess.com/FAQ/Winboard/index.html FAQ on Winboard and Chess Engines] by [[Aaron Tay]]
* [http://www.horizonchess.com/FAQ/Winboard/weaktablebase.html Can use of endgame tablebases weaken play?] from [http://www.horizonchess.com/FAQ/Winboard/index.html FAQ on Winboard and Chess Engines] by [[Aaron Tay]]
* [http://rjlipton.wordpress.com/2010/05/12/can-we-solve-chess-one-day/ Can We Solve Chess One Day? | Gödel's Lost Letter and P=NP] by [[Mathematician#RJLipton|Dick Lipton]], May 12, 2010
* [https://plus.google.com/100454521496393505718/posts 7-man TB] - [https://en.wikipedia.org/wiki/Google%2B Google+]
* [https://github.com/syzygy1/tb syzygy1/tb · GitHub] by [[Ronald de Man]] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=47681 New 6-piece tablebases] by [[Ronald de Man]], [[CCC]], April 01, 2013</ref>
* [https://github.com/dshawul/Scorpio dshawul/Scorpio · GitHub] includes Six men egbb code » [[Scorpio Bitbases]] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=50894 Scorpio 6men EGBB Now available] by [[Joshua Shriver]], [[CCC]], January 14, 2014</ref>
* [https://github.com/kervinck/pfkpk kervinck/pfkpk · GitHub] » [[KPK]] [[Endgame Bitbases|Bitbase]] by [[Marcel van Kervinck]] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=57517 Yet another KPK endgame table generator: pfkpk] by [[Marcel van Kervinck]], [[CCC]], September 05, 2015</ref>
==[[ChessBase]]==
* [http://en.chessbase.com/post/engines-and-endgame-tablebases Engines and endgame tablebases] by [[Albert Silver]], [[ChessBase|ChessBase News]], December 12, 2013
* [http://en.chessbase.com/post/perfect-endgame-play-with-tablebases Perfect endgame play – with tablebases], [[ChessBase|ChessBase News]], April 21, 2015
* [http://en.chessbase.com/post/just-one-of-17-823-400-766-positions-2 Just one of 17,823,400,766 positions] by [[Frederic Friedel]], [[ChessBase|ChessBase News]], April 23, 2015
==[[ChessOK]]==
* [http://chessok.com/?page_id=27966 Lomonosov Endgame Tablebases]
==Online Lookup==
* [http://tb7.chessok.com/ Lomonosov - online 7-man tablebases]
* [http://chessok.com/?page_id=361 Endgame Nalimov Tablebases Online] by [[ChessOK]]
* [http://www.gmchess.com/endgames/ Nalimov EGTB] from [http://www.gmchess.com/index.html GMchess.com]
* [http://www.lokasoft.nl/tbweb.htm Nalimov Tablebase server (DTM)] by [[Lokasoft]]
* [http://www.k4it.de/index.php?topic=egtb&lang=en Web Query for Nalimov Endgame Tablebases (DTM)] from [http://www.k4it.de/index.php?topic=impressum&lang=en Knowledge4IT] by [[Eiko Bleicher]]
* [http://chess.jaet.org/endings/ Chess Archives - Endgames (DTC, DTM, DTZ, DTZ-50)] hosted by [[John Tamplin]]
* [http://www.rack.de/chess/endspiele.cgi Schach Endspiele (DTM)] (German) by [http://www.rack.de Joachim Rack]
==Download==
* [http://kirill-kryukov.com/chess/tablebases-online/ Endgame Tablebases Online - 6-men endgame analysis free for everyone] by [[Kirill Kryukov]] (3,4,5,6 pieces - via [https://en.wikipedia.org/wiki/EMule emule])
* [http://chess.cygnitec.com/tablebases/ Index of /tablebases] by [[Franklin Titus|kingliveson]]
* [http://tablebase.sesse.net/ tablebase.sesse.net] by [[Steinar H. Gunderson|Sesse]]
==Statistics==
* [http://cm.bell-labs.com/who/ken/chesseg.html 6-Piece Database Statistics] by [[Ken Thompson]], 2000
* [http://scid.sourceforge.net/tbstats.html Tablebase endgame frequency statistics]
* [http://www.mathematik.uni-stuttgart.de/~thiel/misc/endgames/ Theoretical statistics for chess endgames with up to five pieces] by [[Mathematician#UlrichThiel|Ulrich Thiel]]
=References=
<references />
'''[[Knowledge|Up one level]]'''
