Author: Bruce Cleaver
Date: 05:19:25 03/22/04
Go up one level in this thread
On March 22, 2004 at 04:38:41, Daniel Shawul wrote: >On March 22, 2004 at 04:10:49, Michel Langeveld wrote: > >>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. >>> >>>thanks >>>daniel >> >>Why not make a mixed approach ... the difficult moves not incrementally and the >>easy moves incrementally >what do you mean? It is the table that is updated not the moves? I think he means udate the attack tables inrementally when it is easy to do so, and calculate them from scratch when you must (AS IN THE CASE OF SOME SLIDERS).
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.