Author: Jari Huikari
Date: 06:31:34 08/31/98
Go up one level in this thread
On August 30, 1998 at 15:26:31, Frank Schneider wrote: > On August 30, 1998 at 12:42:25, Jari Huikari wrote: >> 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... > I've not tried your idea but I think it is likely to fail because when > doing alpha beta with good moveordering ... > a) Nodes where the first or one of the first moves produces a cutoff. > Your can cutoff before 36% of the moves have been searched. Right. A cutoff is made before 36% searched, only if a forced line was found. Perhaps the method I use could find more often the very best move of all, but slower. I doupt my idea because the number of moves to search in one position is so small. But I'll try it anyway. Just a curiosity. Kind 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.