Author: Robert Hyatt
Date: 08:58:29 11/13/00
Go up one level in this thread
On November 12, 2000 at 19:09:04, Bob Durrett wrote: >On November 12, 2000 at 17:17:54, Carlos del Cacho wrote: > >>On November 12, 2000 at 14:29:22, Mike S. wrote: >> >>>But Jeff's question was not about searching more than one move, but about >>>alternative search methods during pondering (with more knowledge, possibly >>>creating plans even, or more selective). Would this make sense, or has this been >>>answered before? Sorry if I missed that. >>> >>>Regards, >>>M.Scheidl >> >>Oh great! If someone could do that, wouldn't he also do it in the normal search? >> >>Carlos > >It would depend on what the programmer's objective was. If the objective were >merely to increase the strength of the program, then you are probably right. >But if the objective were to make the product more attractive to the potential >customers, then maybe not. There is a tradeoff between making the program >stronger or making it better in some other way. I'm not sure I follow. How would pondering in a bizarre way make the program more attractive, assuming it beats you badly no matter _how_ it ponders?
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.