Author: Ernst A. Heinz
Date: 08:02:59 11/05/98
Go up one level in this thread
On November 05, 1998 at 09:47:34, Andrew Dados wrote: > > Suppose somewhere deep in the search I get reduction to B vs 2P ending... >what value >should I assign to it? Side with Bishop can't win - so draw for side with 2P at >minimum... If I assign 2 *P value then my program will sac Knight for Pawn in >B+P vs N+2P...rarely sensible . What should my eval return in B vs P and B >vs >2P ? > > Andrew .....(I better get those tablebases working :) Try to incorporate my efficient implementation framework for interior-node recognizers which allows for the expression of "bounded" knowledge such as "this is at least a draw". A preprint of my according article about efficient interior-node recognizers as published in the ICCA Journal 21(3) is publicly available from the WWW page of "DarkThought" at URL <http://wwwipd.ira.uka.de/Tichy/DarkThought/>. =Ernst=
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.