Author: h.g.muller
Date: 15:07:54 02/09/06
Go up one level in this thread
On February 09, 2006 at 16:43:27, Maurizio De Leo wrote: >You could just make a normal search (without TB) from the root position and >choose the highest scoring move from the ones TB indicate as a draw. > True. Perhaps even better would be to do a search where you let the opponent select his moves according to the regular evaluation of the end leaves, but your own moves according to the TB. In essence use minimax on a non-zero-sum game, assuming that he has no TB and that your evaluation is sufficiently similar to his that you can predict his likely errors. But in the case at hand the normal search is deep enough to see that the choice is between stalemate, K vs K or grossly lost positions.
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.