Author: Dieter Buerssner
Date: 16:32:17 06/17/04
Go up one level in this thread
If anybody wants to implement "bitbases", and really doesn't want to do it more or less with own ideas, the articles of Ernst Heinz show really everything needed. After that, it should only be a programming exercize. The articles are avialable at http://supertech.lcs.mit.edu/~heinz/node17.html Especially interesting in this context: Space-efficient indexing of chess endgame tables. Knowledgeable encoding and querying of endgame databases. Endgame databases and efficient index schemes. Efficient interior-node recognition. But with knowledge of the basic ideas, who to use symmetry to index TB-positions, many people will be able to come up with similar ideas, that should also work well (and perhaps identically). It might be more fun. Regards, Dieter
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.