Author: Bruce Moreland
Date: 13:07:45 01/26/99
Go up one level in this thread
On January 26, 1999 at 15:46:20, Dann Corbit wrote: >You have an interesting point. I would like to propose a hypothesis that can be >easily tested. >1. Given enough time, all excellent chess programs will decide upon the same >best move (possibly infinite). Probably not true, but it's a fine hypothesis. In many cases I think they will tend toward a set of moves that is approximately sound. It might make sense that this set would shrink with time, but it doesn't have to shrink to one move. I would be happy to participate in similar experiments. bruce
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.