Author: Pham Minh Tri
Date: 00:36:52 03/06/01
Go up one level in this thread
On March 06, 2001 at 02:43:58, Tony Werten 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 > >I don't know about your way of studying, but for something completely >different.. How about trying it ? > My first chess program is TSCP (now it changes to x88 structure), then I improve it constantly by learning from books/Internet and many free source codes. The diffirent chess structures do not allow me to copy any code directly into my program, but I have to understand first (a very slow process), get idea and apply it (another slow process). Because of little changing, I could try it any time and work on some completely different parts. Even though this method takes me a lot of time and hard working, it brings me deeper understanding. It is also helpful when I apply to other kinds of chess (chinese chess - a virgin area for computer chess, and gomoku). :-) >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.