Author: Vincent Diepeveen
Date: 15:59:27 10/04/03
Go up one level in this thread
On October 04, 2003 at 18:54:24, Dan Andersson wrote: > 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 Yes it is all very very bad science. I can write down another 100 methods here, but without comparing it with a normal version of diep, i'll be able to proof of course that every algorithm works :)
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.