Author: Simon Waters
Date: 08:15:01 05/31/00
Go up one level in this thread
On May 26, 2000 at 16:50:55, Albert Silver wrote: >On May 25, 2000 at 19:32:13, Simon Waters wrote: > >>On May 22, 2000 at 19:55:54, Peter McKenzie wrote: >>Hmm - well I tried a similar thing with simpler games and genetic type >>approaches. >> >>Here we needed some weighting to optimise play at a game - so I created a scheme >>to modify the weightings of winning programs to create new programs, and made >>them self play. >> >>The new generations would learn to beat the old ones, their off spring would >>beat them, and so on - however after a few generations it was clear the >>strategies were going in circles, like a never ending games of paper, scissors, >>stone. > >Do you mean that older versions could beat the latest ones? i.e. Program A was >beaten by Program B that was beaten by Program C that lost to Program A? What >were some of the changes done and how and when was the circle closed? Exactly. As I said not chess alas - but I would be surprised if similar things were not true in any complex enough problem.
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.