Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Initial Position Search Nodes

Author: David Rasmussen

Date: 13:32:30 10/09/00

Go up one level in this thread


On October 09, 2000 at 09:20:08, Steve Maughan wrote:

>Hi Tony,
>
>>sorry I'm not a cook. What is a vanilla A/B ? Does this mean you start with -oo
>>and + oo ? That would explain somethings.
>
>Aha 'vanilla' is a British expression for 'plain' as in the ice-cream!  No I'm
>not using +/- inf.
>
>>When you're doing the nullmove do you use R=2 ? ( That means you're doing
>>value=-research(dept-3,-b,-a)
>
>R=2
>
>>Did you make sure your killers aren't captures ?
>
>They are not double counted - is that what you mean? - but they can be captures.
>
>It does puzzle me.  I guess it could be simply that my program is young and I
>need to be more selective - but then Crafty isn't that selective.  What does
>XiniX do from the initial position?
>

Well, my program "chezzz" is pretty young and straightforward too, but it
searches to the 9th ply in about 8 secs on a 450MHz PII, with about 1.6 M nodes.
Just to compare.



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.