Author: Uri Blass
Date: 03:02:57 08/26/01
Go up one level in this thread
On August 26, 2001 at 05:51:57, Mike S. wrote: >On August 26, 2001 at 05:38:51, Uri Blass wrote: > >>On August 26, 2001 at 05:16:15, Mike S. wrote: >>>I have read that it searched deeper (the SP/2 8...9 plies during the middlegame, >>>and the chess hardware 5...7 ply additionally each). This would mean, it should >>>have searched 13 ply minimum, up to 16. (...) > >>people do not agree about the meaning of the logfiles and vincent believes that >>11(6) means 11 plies and not 17 plies. >> >>IBM claims that 11(6) means 17 plies but vincent does not believe them. >>(...) >>If I spend 5 hours per position and use my computer 20 hours per week for Deeper >>blue-kasparov games then I need years to finish the job and I am not interested >>so much in the problem in order to give my programs more than 20 hours per week >>or to wait years for all the relevant information. > >Very understandable; I wouldn't like to spend that much time neither. > >But one of my ideas was, that - if today's systems were nearly as strong, or >even stronger than DB - some keymoves should be found within tournament time (or >let's say in 10 minutes maximum). We have discussed that recently... you said >such "key moves", or moves with a tactical test character, were hard to find in >the Kasparov match games. So this lesser time consuming comparison method is >impossible. > >I'm afraid IBM must re-assemble the machine; we can't live with the doubt! :o) > >Regards, >Mike Scheidl There is no chance they will use exactly the same machine and if they return to chess they are going to use stronger software+hardware. Note that if there are other volunteers to give at least 100 hours of computer time per week for the positions then I am going to give also my 20 hours of computer time per week. I believe that it may be possible to find at least one top program with similiar evaluation in part of the positions so if deeper blue was really clearly better we can cases when Deeper blue could find in seconds or minutes the same beginning of the main line that another program needed some hours to find. Uri
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.