Author: Guido Schimmels
Date: 08:48:21 05/03/99
Go up one level in this thread
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 -
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.