Author: Bob Durrett
Date: 14:37:28 11/20/00
Go up one level in this thread
On November 20, 2000 at 14:49:30, walter irvin wrote: >i think that what you suggest is actually possible .but you would always have a >need for a search ,when the result of the position is not known .i think there >should be an opening TB that while it not lead to a mate just an advantage of a >predetermined amout that should be enough for a decent program to win . That seems reasonable. In the real world, a perfect position evaluation could only be approached and never realized, for practical reasons. Hence, in the real world, one might expect that the attempt at position evaluation might fail occasionally. In those cases, the program might have to evaluate more moves from the position than otherwise required.
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.