Computer Chess Club Archives


Search

Terms

Messages

Subject: Crafty question about root move order?

Author: Pham Minh Tri

Date: 20:57:05 03/05/01


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



This page took 0.01 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.