Author: Danniel Corbit
Date: 17:24:42 05/11/98
Go up one level in this thread
On May 11, 1998 at 04:20:58, Bruce Moreland wrote: > >On May 11, 1998 at 03:38:24, Danniel Corbit wrote: > >>Despite this, Deeper Blue would >>probably win anyway. With any player, Karpov, Anand or whoever, they >>can load in every game that they have ever played to tune the computer >>just for that opponent. You would prepare the same way for a special >>foe, but probably would not remember every facet of every game like a >>computer database can. A computer can tirelessly analyze day and night >>the favorite openings and tendencies of a given player and store that >>data for future use. > >No way. > >It is very easy to say this, but much harder to do this. My program's >book is comprised of the games of many GM's, but I have no illusions >that it would beat these GM's very often in tournament games. > >As far as tuning goes, it's hard to tune for anything, much less for a >specific opponent. > >Being able to remember something is not the same as being able to make >use of it. What if you had each move that a particular GM had ever made analyzed to 17 plies or more with a kibits and score saved to a database. Then, if you ever hit any position that they ever played, you will know without needing to calculate the best move. You can even use the time to analyze something else, instead.
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.