Author: Severi Salminen
Date: 05:03:21 03/06/01
Go up one level in this thread
>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). Are you just modifying source codes made by others? I don't like at all the idea of free source codes. Even though it might be easier to make a complete working chess programm by watching what others have done, it leads to everyone making very similar programs. We would see _a lot_ of variety among engines if everybody started from scratch. You also would understand things a lot better by _not_ watching what others do but by trying things yourself and by making those errors. Errors lead to understanding. Of course it is good idea to ask information here about different techniques but having complete code available is not a good thing in my opinion. >>>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? I have not looked at Crafty but i don't see why qsearch should have anything to do with root move ordering. Of course it might be better ordering than nothing but there are even better ways (I have not tested qsearch, though): order the PV move first and then the rest according to node count from previous iteration. It seems to work quite well and is very easy to implement. Try out the qsearch and report the results here, it would be interesting. Optimal sorting at every node is: best move first and then the rest. Somehow we should try to guess what is the best move beforehand. Severi
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.