Author: Will Singleton
Date: 14:16:41 05/03/99
Go up one level in this thread
On May 03, 1999 at 11:48:21, Guido Schimmels wrote: >On May 03, 1999 at 09:24:49, Andrew Williams wrote: > >>I don't have ChessBase, but I think any such feature must be based on doing >>n searches - which should be n times slower. If you ask for the best two moves >>does it take (a little less than) twice as long? Perhaps I'm missing something? >> >>Andrew > >No, you don't miss anything :) >It is done by leaving alpha/beta untouched (at root level) until after move n. >And of course this slows things down terribly. > >- Guido - Hmm.. by "untouched", do you mean +- inf? Or rather, do you keep the window narrow around the expected result? Because if, for example, there's only one good move, then moves 2-n will fail low, and you won't get the score back. And is it pvs, mtd, or ? Will
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.