Author: Ronald de Man
Date: 14:38:59 12/17/05
Go up one level in this thread
But what are the chances that the new not-really-best move is a "Great" move? Most likely quite a bit lower than the probability that head shows up. In any case, making the search less deterministically can be desirable e.g. just out of book. What you could do is give each root move a random increment before you start the search. The increment represents the (random) preference you have for this move. You then search all moves with alpha,beta shifted downwards by this value. The result seems close to what you describe, but with the coins tossed at the start of the search. It should not blow up the search tree (but hashtable cutoffs might be less frequent).
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.