Author: Tony Werten
Date: 23:43:58 03/05/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 I don't know about your way of studying, but for something completely different.. How about trying it ? Tony >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 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.