Author: Omid David Tabibi
Date: 15:15:07 10/04/03
Go up one level in this thread
On October 04, 2003 at 17:56:56, Dan Andersson wrote: > A-B C Search has nothing to do with Conspiracy search. That's why it is so interesting. Using the idea of conspiracy search within the common area of AB. I remember that GCP has tried ABC and posted an interesting result of a problem solved quickly using ABC. I wonder whether he is using ABC as Deep Sjeng's backbone algorithm now. It seems that Fritz, Shredder, Ferret, Diep, and Crafty use null-move pruning as the main algorithm (based on what their authors say), and I think Chess Tiger too. Junior and Rebel use knowledge based extensions/reductions. An especially interesting engine is Hiarcs, which finds some very deep tactical combinations after only a few iterations. Anyone using some radically different search algorithm like ABC?!... >Both Vincent and Robert >have made the same mistake as you though. > >MvH Dan Andersson
This page took 0.01 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.