Author: Bob Durrett
Date: 09:14:57 11/20/00
Go up one level in this thread
On November 20, 2000 at 11:55:10, Bo Persson wrote: >On November 20, 2000 at 11:06:46, Bob Durrett wrote: > >>Would it be possible to evaluate a position so well that only one next move >>would need to be considered? In that case, "selective search" would not involve >>any selection at all [i.e. nothing to chose between]. The "selection" would be >>done during the position evaluation. In the limiting case, only ONE line would >>need to be evaluated, except in the cases when two or more moves were found >>[during the position evaluation] to be of equal value. > >If it was possible, you would have solved chess! :-) > >Just let the program run from the start position, and see if it comes up with >e2-e4 or d2-d4 as the optimum opning. Repeat for 40 plies and you end up in a >check mate for white (or a draw??). You are assuming that one or the other of 1.e4 or 1.d4 is the better move. Maybe not a valid assumption! Incidentally, the position evaluation software may have to declare two or more moves "equal" if they appear to be reasonably close. How "reasonably" would be defined in this case would be up to the programmer. > > >Bo Persson >bop@malmo.mail.telia.com
This page took 0.01 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.