Author: Robert Hyatt
Date: 08:53:39 09/08/00
Go up one level in this thread
On September 08, 2000 at 11:14:58, Vincent Diepeveen wrote: >On September 07, 2000 at 23:44:12, Uri Blass wrote: > >>On September 07, 2000 at 23:02:31, michael wrote: >> >>> too tell which moves are better: >>>run a program over DB's games with a short time length that gives most moves >>>different(inferior) to DB. increase the time length until the moves seem mostly >>>similar. now increase the time length again and see if still more of the >>>suggested moves converge to DB's moves or alter to a (hopefully superior) set of >>>moves. if you can feasibly let your program run long enough that you diverge >>>from DB then i think you are doing better >> >>Interesting idea but it is possible that you will not get the result that you >>expect. >> >>You can get something like: >>In 1 minutes per move 55% of the moves are the same. >>In 2 minutes per move 60% of the moves are the same. >>In 4 minutes per move 58% of the moves are the same. >>In 8 minutes per move 59% of the moves are the same. >> >>Uri > >exactly. DB made very little good moves especially in the openingsphase, >i didn't found it play that bad in endgame compared to nowadays chess programs. > >However searching 8 minutes a move you'll outsearch DB pathetically. How? I didn't see anybody that can search 16-18 plies in 5 minutes as DB did against Kasparov... so how is someone going to outsearch it with only 3-4 more minutes?
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.