Author: Jari Huikari
Date: 03:16:07 09/01/98
Go up one level in this thread
On August 30, 1998 at 15:26:31, Frank Schneider wrote: >>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... >But if you try it I'd be interested in the results! You (all of you) can test the early version of my program, It uses optimal stopping in higher plies, and in first ply it chooses five best moves after some iterations. (to search only them further) Download: http://www.math.jyu.fi/~huikari/NERO4.ZIP (DOS, 50kB) (Tell me, if you find bugs.) Regards, Jari
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.