Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: root search ordening

Author: Christophe Theron

Date: 19:41:32 05/02/01

Go up one level in this thread


On May 02, 2001 at 12:04:33, Ulrich Tuerke wrote:

>On May 02, 2001 at 11:47:15, Gian-Carlo Pascutto wrote:
>
>>On May 02, 2001 at 11:36:08, Ulrich Tuerke wrote:
>>
>>>This way, you will have heavily extended root moves rather early in your move
>>>list. These moves must not always be good.
>>>
>>>Don't you regard this as a draw-back ?
>>>
>>>The advantage is perhaps that nice tactics (checking sacs ...) will be seen
>>>early.
>>
>>Well there's a reason why these moves are so heavily extended. Something
>>interesting must be happening there. Even if they aren't good (according
>>to the search) yet there's a good chance they'll change score quickly
>>soon.
>>
>>You do want to look those interesting moves first next iteration
>>don't you :)
>
>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. :)



    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.