Author: Gian-Carlo Pascutto
Date: 06:39:54 12/20/02
Go up one level in this thread
On December 19, 2002 at 08:56:45, Dan Andersson wrote: >There is a paper about alpha-beta conspiracy search. The idea is simple. You use >fractional extensions. And have two depth variables one for each side. Then you >deduct less than a ply based on some criterion. The paper used a sigmoid >function based on the mobility for the side to move. And you continue to search >deeper as long as one of the depth measures is above zero. I really like this >idea. It is easy to implement. > >MvH Dan Andersson It's not so easy to implement correctly IMHO, and it works like shit. -- GCP
This page took 0.01 seconds to execute
Last modified: Thu, 07 Jul 11 08:48:38 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.