Computer Chess Club Archives

Search

Messages

Subject: Re: Crafty question about root move order?

Author: Robert Hyatt

Date: 07:39:05 03/06/01

Go up one level in this thread

On March 05, 2001 at 23:57:05, Pham Minh Tri wrote:

>Hi Dr. Hyatt,
>
>I am studying your RootMoveList function and wondering if its method of ordering
>could be replaced by calling Quiesce function.
>
>I mean the value for ordering could compute simply as following:
>
> value = -Quiesce(tree,-MATE-1,MATE+1,ChangeSide(wtm),INCPLY,1);
>
>(need not call Evaluation and EnPrise functions)
>Could it work with the same result? Do I miss something?
>
>Thank in advance for your advice,
>Pham

Probably would work find.  Might take a bit longer to sort the move list
since that quiesce() call could be quite complex.  The question is, would the
probably more accurate move ordering offset the cost, or not?

• Re: Crafty question about root move order? Pham Minh Tri 22:03:40 03/06/01
  • Re: Crafty question about root move order? - THE RESULT!!! Pham Minh Tri 22:01:58 03/07/01
    • A nice speedup - maybe (?) Jeremiah Penery 03:39:59 03/08/01
      • Re: A nice speedup - maybe (?) Robert Hyatt 07:23:54 03/08/01
        • Re: A nice speedup - maybe (?) Robert Hyatt 08:24:48 03/08/01
          • Re: A nice speedup - maybe (?) Pham Minh Tri 18:04:05 03/08/01
      • Re: A nice speedup - maybe (?) Miguel A. Ballicora 07:22:43 03/08/01
    • Re: Crafty question about root move order? - THE RESULT!!! Severi Salminen 23:46:17 03/07/01
      • Re: Crafty question about root move order? - THE RESULT!!! Pham Minh Tri 17:46:31 03/08/01
        • Re: Crafty question about root move order? - THE RESULT!!! Severi Salminen 04:09:55 03/09/01

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.