Author: Slater Wold
Date: 09:26:02 02/25/02
Go up one level in this thread
On February 25, 2002 at 11:35:02, K. Burcham wrote: > > >I agree, but it seems the problem with playing on the Deep Blue level is >kns. If we are getting 2000kns today, with the dual machines, then we will >have to wait on hardware upgrades. Hyatt said that Deep Blue was getting >200,000,000 nodes a second--we are only getting 2,000,000 nodes a second. >Hardware will have to reach closer to this level to test todays search methods >in comparison to Deep Blue's search methods. If this is true what Hyatt is >saying, and I have no reason not to believe this, then I have learned my 3100 >mhz and 1000 megs ram, is very limited in being able to compare todays programs >to the six game Deep Blue match with Kasparov. The more time I spend testing >positions in this match, the more I dissagree with Uri. I feel if Uri had >spent the time and money that I have in testing this match, then I dont think he >would take such a stand comparing todays programs with Deep Blue. > >I have started over again with the six game Deep Blue match. I am using the >following: > >Fritz7 1500mhz 512ram >Chess Tiger 14 1000mhz 384ram >Deep Shredder6 3100mhz 1000ram > >Starting with game one, I will run all three programs until a Deep Blue move >is not played by any program. I will then give all three programs 24 hours to >find the Deep Blue move. If none of the programs will play the Deep Blue move >after 24 hours, I will move to the next move. This move will be noted. > >I wanted to use Century 4.0, but I have not learned all of the interface >necessary to cut and paste, clipboard, save as, etc. with the windows-dos. > >I feel game one will go very fast, because I think most moves can be found in >this game. It seems some settings were changed between game one and game two, >because finding moves after game one became more difficult. > >Anyone have any advice on how to improve this project, please let me know. >I will record: 1. moves not found 2. moves found after 30+ minute search >3. which program found which moves. 4. Total time of analysis after each game. >kburcham 200M was average. It hit a billion nodes in some positions. The people who make the claims that DB is not stronger than a top program on todays top PC's, are the same ones who said it wasn't "much" better than their program on a PC 5 years ago.
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.