Author: Dieter Buerssner
Date: 11:59:06 06/20/03
Go up one level in this thread
On June 20, 2003 at 09:12:57, Ulrich Tuerke wrote: >I don't think that solving this position is a matter of pruning or extensions, >since Comet could solve it on a 16 MHz 80386 in a few seconds. >It's rather a test for hash replacement rules, i.e. handling situations where >the hash table is overflowing heavily which is of course the case here. Uli, I think, "overflowing" of HTs is not a big problem here. Many engines will solve this very fast - in a time where a typical sized HT (say few MBs) will not be filled up very much. BTW. I tested this without HTs some time ago. It needed about 8 hours - IIRC (seeing a pawn win at ply 26). With only 10 kBytes of HTs (831 entries), the position gets solved immediately! As with any other size. With those 831 hash entries, depth 28 is reached in 1 s. Quite a few orders of magnitude speed increase for a few hash entries. Of course, in this situation (where the HTs really are overcrowded), the replacing scheme may play a significant role. Regards, Dieter
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.