Author: Tord Romstad
Date: 08:18:03 08/24/03
Go up one level in this thread
On August 24, 2003 at 07:35:12, Sune Fischer wrote: >Hmm you have not understood completely how the table works I think. >As Uri also did point out, a table lookup for SEE doesn't work with this ploy. > >I'm not sure such a table can even be constructed, one could compute the number >of bits theoreticly required by a crafty type SEE. >I suspect such a table would be huge. If implemented as an array, definitely. But perhaps it is worth trying to use some kind of hash table to cache the results? I haven't investigated this, but my guess is that the number of combinations of attackers which occur in the search tree from a given root position is usually not very big. Tord
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.