Author: Danniel Corbit
Date: 00:52:25 05/12/98
Go up one level in this thread
On May 12, 1998 at 03:32:01, Bruce Moreland wrote: > >On May 11, 1998 at 20:24:42, Danniel Corbit wrote: > >>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. > >A computer that spends a long time analyzing an opening position is like >an unintelligent person who spends a long time thinking about nuclear >physics. > >Opening preparation would help. > >Perhaps a program could find some cooks. > >But this isn't a magic bullet. Not just the opening position. Every position they have ever played. From first move to end of game. Our goals become much shorter. Sometimes, we will be on a pre-analyzed position. Sometimes we will be a single move away from a set of pre-analyzed positions. We can pick one as a goal, based on its calculated value. This is like a little tiny mate, and not far away. And if it cannot be achieved, we can discover this quickly and compute as normal. But this new method plays much more like a human. A bunch of pretty good moves [when the technique does not work and we have to work 'as usual'] and occasionally a brilliant one [when we have a database hit of a very good position or figure out how to force one]. If we had every move ever made by every GM analyzed and stored in a database, along with a 17 ply evaluation [or whatever is feasible], we will very frequently hit upon a 'deja vu' or at least know how to get there.
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.