Author: Dan Andersson
Date: 15:54:24 10/04/03
Go up one level in this thread
No problem. I have to agree that the name is pretty crummy. And I believe a somewhat similar scheme is mentioned in quite old papers. That older scheme used a probability limit for cutting off search. They begun with P1=1.0 and a limit p. And for each expanded node they multiplied a futility factor based on some criterion. And if Pn<p they cut search off. MvH Dan Andersson
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.