Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: How can fritz fill 200-300Mbytes hash tables in rapid chess?

Author: Vincent Diepeveen

Date: 10:08:40 06/21/98

Go up one level in this thread



On June 20, 1998 at 13:32:52, Mark Young wrote:

>On June 20, 1998 at 09:39:10, blass uri wrote:
>
>>Fritz5 cannot fill 200-300Mbytes transposition tables in regular chess
>>if I use my computer (Pentium 200MMX)
>>so even if I assume the computer they use against anand is a 4 times faster
>>they cannot fill 200-300Mbytes against anand.
>>
>>I understood they use 2 Pentium II 333Mh against anand.
>>
>>I did not find information of what chessbase mean by rapid chess
>>if it is 30 minutes per game or 25 minutes per game or 1 hour per game.

You can fill 300MB easily.

Especially fritz.

If you don't clean your hashtable (and fritz doesn't do this), then
you have 30 minutes to fill it. With around 300k nodes a second
(i'm not sure how fast fritz5 is at PII-400, but a 400 is fast)
you're there quickly.

So the more the better.

>>Uri
>
>When Fritz 5 gets crushed by Anand at least Chess Base can't say they did not
>have enough ram. :)



This page took 0.01 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.