Author: Tom Kerrigan
Date: 16:30:53 01/27/00
Go up one level in this thread
On January 27, 2000 at 18:12:46, Timothy J. Frohlick wrote: >On January 27, 2000 at 17:27:04, Dann Corbit wrote: > >>On January 27, 2000 at 17:13:34, Timothy J. Frohlick wrote: >>[snip] >>>Right on Tim, >>> >>>This is especially true when the 1 and 2 ply searches may be full-width and the >>>30 and 31 ply searches are always selective searches. We know that DB was >>>thousands of times faster than any chess computers in the average home and it >>>only managed to hold its' own against Kasparov. If the rating goes up linearly >>>then DB should have had a rating of elo 3000+++ > > >Chess computers in the average home are 1/4 the speed of computers that Dann >Corbit uses. Also, don't forget that the databases used in DB were orders of >magnitude bigger than what us poor mortals use. I have a 400MHz Celeron and my program searches about 200k NPS. It's not particularly fast or slow. I think his estimates are absolutely dead-on. Regarding the databases that were used... The opening book is a brillant example of "more is not always better." -Tom
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.