Author: Steve Coladonato
Date: 06:48:11 01/19/00
Go up one level in this thread
<snip> >>Dave, >> >>Thanks. From this and also what Michel posted, I gather that a TB is some kind >>of ordered list based on some criteria that, once a root position is reached, is >>searched repeatedly for the next move. And it's structure is not like that of a >>tree. >> >>Steve > >The tablebase is a giagntic, collision-free hash table. You have a hash >function that takes a board position (where all the pieces are, whose move it >is, is castling legal, et cetera) and tells you the spot in the hash table that >contains the data you need for that position (who is to win, and in how many >moves.) > >It is possible to have an ordered list, and use binary search to find >information on the position you are interested in, but hashing is faster for >looking up stuff, because no searching is involved. You can find more >information on "hashing" in books that deal with computer algorithms. It is a >general technique that is often used when data retrieval must be fast, and >certain other constraints are met. > >Dave Dave, OK. Now, if the information for the position also contains the best move, the program would make that move and then do a hash lookup on the position arising from the opponent's move. The assumption is that once a TB position has been reached, all possible subsequent positions are in the TB. Am I any closer? Steve
This page took 0.01 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.