Author: Bo Persson
Date: 08:31:11 10/11/05
Go up one level in this thread
On October 11, 2005 at 05:35:57, chandler yergin wrote: >> >>A program may search deeper but still lose because of inferior evaluation. > >No, We disagree 100% The Program truly does evaluate 'every' possible move in >any position! It ranks them in order of the highest return from the Alpha Beta >& Mini/Max algorithim. The centipawn eval is based only on the static positional >factors programmed in. The program that searches the deepest in the >alloted time will find the better moves. Unless the evaluation is not good enough. How do you know that the position with the highest eval is really the best? If you spend more time evaluating additional factors, you might get a better score (meaning the odds are higher that it reflects the "real" value of the position). Spending more time, of course means that you search fewer positions. If you have no eval at all, you can search an amazing number of positions per second, but you will hardly ever find the winning move. >I don't understand why you don't understand this! > >> >>Searching deeper is a clear advantage but computer chess is not only about >>searching deeper. > >It's exactly about searching deeper! No, it's about finding a better move than the opponent. :-) Bo Persson > >> >>Uri
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.