Author: Erik Evenson
Date: 06:00:39 08/01/01
Thanks again for the responses to my previous posts. I got replies that gave me links to code that read Nalimov tablebases. My main interest is in creating my own version of the tablebases (perhaps just the 3-mans first), just to understand how they are created. My plan to do this is (please tell me where I have gone astray...): A) Start with, say, KQK endgame. B) Generate the 64x63x62 possible positions. C) Eliminate the checkmated positions. D) Eliminate the positions where the King is in check and the opposition is to move (expected to be a large number). E) For each position, generate mainlines to mate using minmax with no pruning but with full transpositional table. F) Store results in a compressed form that allows my engine to probe with a call like bestMove=getMoveFromTablebase(KQK); G) Repeat for next endgame type. Comments? Thanks in advance -- I'm having way too much fun building this engine...
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.