Author: Dave Gomboc
Date: 20:07:19 08/31/98
Go up one level in this thread
On August 31, 1998 at 08:33:39, Jari Huikari wrote: >On August 30, 1998 at 17:29:06, David Eppstein wrote: > >>The whole point of the optimal stopping problem is that you are not allowed to >>go back and choose one of your candidates after looking at a later candidate. > >Yes, that's right with classic secretary problem. My idea is not to >throw away the first candidates. The best one will be kept all the time. >I use only the stopping criteria. If I don't find any better in the last >64% of moves, I have the best one found earlier. > > Jari Yngvi Bjornsson at the University of Alberta has already investigated tree-pruning work along these lines. I don't recall if he's published anything yet but I know I saw a draft of something first hand earlier this year. Dave Gomboc
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.