Author: stuart taylor
Date: 03:53:08 04/28/00
Go up one level in this thread
On April 27, 2000 at 22:41:19, Pete Galati wrote: >On April 27, 2000 at 21:58:09, stuart taylor wrote: > >>Is it possible to program a computer to set many possible future scenarios of >>favourable positions possible to arrive at with same material ballance (from >>that current position-some time later, even 40-60 ply's or more), then have the >>program find ways how to get there? >> If so, then computers will be able to plan like a top-class human! >>I mean with same pieces or after various exchanges-which may be possible to >>provoke purposefully or forecefully, and to weigh up pros and cons of the >>outcomes of counter plans, and their possibilities of excecution, and there not >>being any snags along the way. >> So the program will be thinking in plans and patterns as well as in >>calculations. >> It would be a bit random-like at first, then the best scenarios would be >>computed. etc. > >I'm having trouble with the wording of your post, are you talking about a >database solution? > >Pete Maybe, new databases can be created for each game individually according to estimations of possible resulting positions-as well as the databases and other knowledge which it has upon which the former estimations can be based on. I'm not a computer technician at all. However. S.Taylor
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.