Author: Bob Durrett
Date: 12:44:55 12/11/02
Go up one level in this thread
On December 11, 2002 at 15:21:35, Angrim wrote: <snip> > >The solution tree is the tree of all positions whose value needs to >be known to prove the value of the position being proven. >For the case of proving that white wins a position, this tree >would have to have *all* possible moves by black for each position >with black to move, and *a* winning move for white for each position >with white to move. > >Hope that clears it up a little. >Angrim That sounds like a terribly big tree!!!! Maybe proof is not essential after all. Perhaps something short of a perfect air-tight proof would be good enough for practical use. Time to get out the pruning shears. Bob D.
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.