Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: A nice speedup - maybe (?)

Author: Miguel A. Ballicora

Date: 07:22:43 03/08/01

Go up one level in this thread


On March 08, 2001 at 06:39:59, Jeremiah Penery wrote:

>On March 08, 2001 at 01:01:58, Pham Minh Tri wrote:
>
>>On March 07, 2001 at 01:03:40, Pham Minh Tri wrote:
>>
>>>On March 06, 2001 at 10:39:05, Robert Hyatt wrote:
>>>
>>>>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:
>
><slightly modified line below, to make it have the correct number of parameters>
>>>>> value = -Quiesce(tree,-MATE-1,MATE+1,ChangeSide(wtm),1);

This is like a minimax at ply one right?

Regards,
Miguel



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.