25,161
edits
Changes
no edit summary
=License=
In the late 90s Nalimov Tablebases became defacto standard and were used in many [[:Category:Commercial Engines|commercial]], [[:Category:Private Engines|private]] and free chess engines and [[GUI|GUI's]]. A reference implementation by Eugene Nalimov and [[Robert Hyatt]] was realized in [[Crafty]], with Tablebases and probing code available from Bob Hyatt's site <ref>[http://www.cis.uab.edu/hyatt/crafty/TB/ Index of /hyatt/crafty/TB] hosted by [[Robert Hyatt]]</ref>. Probing could easily incorporated into own chess engines, however the license policy requires explicit permission by Eugene Nalimov<ref>[https://www.stmintz.com/ccc/index.php?id=442822 To sumarize this] by [[Thomas Mayer]], [[CCC]], August 17, 2005</ref>.
=See also=
* [[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]], [[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]]
* [[Eugene Nalimov|Eugène Nalimov]] ('''2002'''). ''Chess Endgame Tablebases''. [[Eugène Nalimov#Lecture|Invited Lecture]], [[7th Computer Olympiad#Workshop|7th Computer Olympiad Workshop]]
* [[Guy Haworth]] ('''2005'''). ''[http://centaur.reading.ac.uk/4522/ 6-Man Chess Solved]''. [[ICGA Journal#28_3|ICGA Journal, Vol. 28, No. 3]]
