Author: Robert Hyatt
Date: 21:57:40 12/04/03
Go up one level in this thread
On December 04, 2003 at 21:55:06, Russell Reagan wrote: >On December 04, 2003 at 10:15:36, Robert Hyatt wrote: > >>But if you do the N-best search as given, your EBF should not change >>whether N=1 (normal) or N=99. > >I was thinking of a scenario where the program was doing pruning using the N >search results. I think it's pretty clear that no one would do N searches for no >reason, other than ignorance :) You really have to to show N-best moves and scores. And you have to do it every iteration in an iterated search... you don't know when you will stop.
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.