Computer Chess Club Archives

Search

Messages

Subject: Re: Optimal stopping in chess program

Author: Jari Huikari

Date: 05:33:39 08/31/98

Go up one level in this thread

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

• Re: Optimal stopping in chess program Fernando Villegas 14:52:24 09/01/98
  • Re: Optimal stopping in chess program Jari Huikari 05:37:22 09/02/98
• Re: Optimal stopping in chess program Dave Gomboc 20:07:19 08/31/98
  • Re: Optimal stopping in chess program Robert Henry Durrett 06:33:22 09/01/98

This page took 0.01 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.