Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: root search ordening

Author: Tony Werten

Date: 15:31:24 05/03/01

Go up one level in this thread


On May 03, 2001 at 14:47:17, Christophe Theron wrote:

>On May 03, 2001 at 02:44:49, Ulrich Tuerke wrote:
>
>>>...
>>>>
>>>>Quiet moves can be interesting too. Giving check can be a waste of time.
>>>>After all, many are using the node count scheme.
>>>>So I guess, it can't be bad.
>>>>
>>>>I do something different (estimates of scores). It's probably not better.
>>>>
>>>>Uli
>>>
>>>
>>>
>>>I do the same Uli. I see we are at least two in the club. :)
>>
>>I'm sure that the club isn't that small. My feeling is that the node counting
>>isn't bad for root move ordering but there may be even something better.
>
>
>Actually the idea to order root moves by node counter seems very strange to me.
>

I'm suprised.

If a certain move leads to positions with a lot of extensions, it seems to be
interesting and it will have a lot of nodes.

If a move leads to a lot cutoffs, it seems bad and will have few nodes.

I found the idea quite logical, it seems to work for my engine and I would have
guessed it would work even better for more speculative engines like Tiger and
the King.

cheers,

Tony

>
>
>>BTW, meanwhile I've made large matches between your tiger and my poor comet. The
>>few games which I had reported previously, now seem quite lucky. The gambit
>>tiger ist strong as hell, too.
>>
>>May well be the strongest engines currently. Congrats for this impressive
>>success, Chris.
>
>
>Thanks, you know it's a lot of work to get there.
>
>
>
>    Christophe



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.