Author: John Merlino
Date: 11:11:00 07/21/01
Go up one level in this thread
On July 21, 2001 at 06:07:56, Ulrich Tuerke wrote: >On July 20, 2001 at 19:25:00, John Merlino wrote: >> >>Amazing what 1MB of memory can do, eh? > >Far less is sufficient here. I remember very well, that the old DOS comet on a >386 confined to a total max of 640 K memory (without DOS extender) solved this >already in a few seconds in iteration 18. I think that the search tree is very >small, accounting for transpositions. > >For positions of this kind (only kings and mainly blocked pawns), a hash table >of size 64 K will already help a lot. > >Uli I also tried CM with its minimum of 512K for the hash table, and the results were identical to 1MB. With the CM GUI, it's nothing or at least 512K. jm
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.