Author: Jay Scott
Date: 12:58:34 05/14/99
Go up one level in this thread
On May 14, 1999 at 15:40:52, Timothy J. Frohlick wrote: >I'm no mathematician but when you have a decision tree with many outcomes and >you choose a particular path then the outcome is always contingent on unexpected >events. The point beyond which deeper search is guaranteed not to pay off is when the position is solved--when all the events have been checked, so none of them can be unexpected. We aren't in danger of getting there any time soon. :-) Jay
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.