Author: Dave Gomboc
Date: 05:31:06 12/09/99
Go up one level in this thread
On December 08, 1999 at 17:15:28, Vincent Diepeveen wrote: >On December 08, 1999 at 15:28:46, Eugene Nalimov wrote: > >>Main benefit from hashing is not cutoff of the entire line - that happens rare >>in the middlegame (let's say speedup will be ~10%). Main benefit is that you >>often get the best move from the shallow search, and there are good chances that >>that move will be good for deeper search. Even slightly better moves ordering >>helps alphabeta a lot. >> >>And of course it's better to have iterative deepening as well. > >>Eugene > >For the average program getting only a few ply at 486, >this might be true, but i'm sure the top >programs at depths they search nowadays this is no longer >true. What do you base this conclusion on? I've worked with 24-ply searches (not chess), and it still matters. Dave
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.