Author: Russell Reagan
Date: 19:27:07 02/13/02
Go up one level in this thread
On February 13, 2002 at 18:48:18, Angrim wrote: >Not only is the file compressed, but the positions are not stored in it. >There is no point using 18 bits to store a position, when you know what >the position was from the index into the file. Only the positions value >is stored in the file. >Your design was pretty good for someone who hasn't studied the currently >used methods though. > >Angrim I'm not quite sure how all of this works. If there is some published material on this topic or websites that explain it thoroughly feel more than welcome to point me to those sources. I'd like to get a good understanding of what's going on with tablebases. To me, I don't see how you can not store the position in the TB file. I guess I can see a way you could make an algorithm that creates the index from the position, and then when you look up that index you get the mate distance. That makes sense, but just in theory (to me). Hopefully you guys will be able to refer me to some papers published on this or some good websites. Thanks for all the help so far, Russell
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.