Author: Tord Romstad
Date: 06:00:14 01/08/04
Go up one level in this thread
On January 08, 2004 at 08:06:46, Andreas Herrmann wrote: >On January 08, 2004 at 07:56:28, Tord Romstad wrote: > >>I originally used a table almost identical to Ed's, but recently I >>have switched to using a small SEE cache (the size is 2 KB). There >>was no noticable slowdown. I am fairly sure a similar approach >>(perhaps with a somewhat bigger cache) would also work well with >>Andreas' bigger attack tables. >> >>Tord > >great idea to handle it with a cache. I will think about a similar way. The way I am doing this is probably far from optimal (I spent only a few minutes designing it), but it works reasonably well. I use something similar to Zobrist hashing to compute hash keys. I have random 32-bit integers for all possible attack vectors, all possible defence vectors, and all different pieces. These numbers are simply XORed together to obtain a hash key. 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.