Author: Ed Schröder
Date: 23:21:54 01/16/98
Go up one level in this thread
>Posted by Detlef Pordzik on January 16, 1998 at 22:36:10: >In Reply to: Re: Computer(CPU)benchmark for chessprograms posted by Bruce >Moreland on January 16, 1998 at 16:26:52: >This sounds remarkable to me, since I haven't such a good >education of the " what's going on inside ". >As far as I know, and from my own experience, progs like, for >instance, G5 don't care too much for big hash tables, whilst, >for example, R9 fills up his maximum capacity of 60 megs quite >fast - mostly. >I once had a try with F5 - just to see, if it really was true, and >allowed him 85 megs on my 128 MB system.....full within about 5 minutes >- I simply can't believe, that this is efficient ? >Now to my question : >is there, using W 95, a kinda standard or approx formula, how much hash >to allow the program working on unlimited analysis time, which means, >for example, 8 hours ? Every programmer has his own view how to program the hash table. Typical for Rebel is that it stores and uses the q-search results in the hash table (most programs don't do that, true?). Another typical Rebel hash table behavior is that it doesn't store positions in the hash table that have no "best move". The latter speed up Rebel a little. The story: take 40 chess programs and you will notice 40 different hash table behaviors. - Ed - >Then, of course, stand alone. - Or is it so - as I would suggest, that >it depends on the prog in the end....and in one's own experience ?
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.