Author: Robert Hyatt
Date: 10:49:06 09/19/99
Go up one level in this thread
On September 19, 1999 at 13:36:17, JR wrote: >I have begining to research about a chess-computer program based in the concept >that each one position in the board has one and only one mathematical value and >this means that the next move to search must to improve this value. >Because in one turn there are a limited number the moves and maybe only one is >the best.When my program defeat all GM and chess computer programs it will means >that the target was reached. Before you go too far, look up two terms: (a) local maxima and (b) horizon effect. Your approach will suffer from both, horribly, if you don't do a lot more searching...
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.