Computer Chess Club Archives


Search

Terms

Messages

Subject: Optimal stopping in chess program

Author: Jari Huikari

Date: 09:42:25 08/30/98


Hi, folks!

Nero 3 is losing every game in FSV's summer tournament...

but Nero 4 will be reality until the end of this year, and it will
be a better program. It already finds forced mates in a very short time.

It will need pruning in the search tree for other kind of moves. I'm of
course going to use alpha-beta, but as a curiosity I'm currentkly trying
something different namely optimal stopping for secretary problem:

If you are looking for secretary and have a big number of candidates,
a good method is take a look for first 36% (or so), and after that
choose the first candidate after them, who is better than them all.

Now I try the same method for picking the best move. Taking a look
of the moves in random order, and after searched 36% or so, doing
cutoff, when a better move was found...

Has anyone tried anything similar? Experiences?

					Jari





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.