Author: Dann Corbit
Date: 07:27:00 03/22/04
Go up one level in this thread
On March 22, 2004 at 03:40:57, Daniel Shawul wrote: >Hello > >I have decided to use attack tables. I just did >a rough implementation of it at the beginning of the eval >according to Ed's paper. The problem is the thing dropped the nodecount >by almost 40% . Initial position nodecount was 800000 and now it is 500000. >Do incremental move attack tables help? And how do i update the table? It seems >very difficult to update a sliding move and other special cases. You can precalculate a lot of the work. It's easy with bitboards. I don't know about 0x88 since I never tried it. You can almost eliminate quiescent search if you return enough information.
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.