Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Alpha-Beta Conspiracy Search

Author: Russell Reagan

Date: 15:40:08 10/04/03

Go up one level in this thread


On October 04, 2003 at 18:15:07, Omid David Tabibi wrote:

>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.

I also remember (maybe we're thinking of the same thing) an instance where he
solved a problem using a PN2 search in Sjeng, IIRC.


>Null move...I think Chess Tiger too.

I don't think Christophe uses null move. At least, if he does, I don't think
it's the "main algorithm" contributing to Chess Tiger's strength. I remember
posts where he said things like, "and that's why Crafty is consistently 100 ELO
points lower than the top engines," in reference to Crafty using null move,
which indicates to me that he either doesn't use it, doesn't think very highly
of it, or he has other things that impact the playing strength to a greater
extent.


>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.

And let's not forget The King, which finds those mate in 20's at ply 1 in zero
seconds :)



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.