Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: root search ordening

Author: Ulrich Tuerke

Date: 23:44:49 05/02/01

Go up one level in this thread


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

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.

Uli



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