Author: Daniel Clausen
Date: 04:57:00 06/14/02
Go up one level in this thread
On June 14, 2002 at 07:38:34, Uri Blass wrote: >On June 14, 2002 at 03:49:37, Dann Corbit wrote: [snip] >>This is a very strange statement if you have hash tables. I have never seen >>any program spend most of its time in generation if it uses hash tables. >> >>[snip] > >Hash tables are used today only for better order of moves and not to prune the >tree. When you try the associated move in the HT first (and therefore using the HT for move-ordering) you don't necessarily have to call movegen(). All you have to do it to verify that the stored move indeed is a legal move in this position. If you use the HT like that, I'd be surprised if your engine uses so much time in the movegen() part. Sargon
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.