Author: Uri Blass
Date: 08:17:38 12/11/02
Go up one level in this thread
On December 11, 2002 at 10:38:56, Nicolas GUIBERT wrote: >>yes but the point is that I believe that the search algorithm of the good >>programs can be improved significantly. > >I sometimes have this feeling too when I am far from my computer. > >But everytime I try something new, the result is disapointing. > >As if you got burned every time you went too far away from brute force ? > >Any one else got this feeling ? I think that the right thing is to have the right ideas. I believe that I already use an idea that is good not only for chess but also for other games about pruning. My main problem is programming. I do not like to write a big code for evaluation because I am afraid from bugs. My choice to have incremental evaluation also does not help much but I prefer incremental evaluation because of the fact that it give me more information(I can use the exact evaluation or changes in the evaluation for my decisions). I have a complicated move generator but I used the function perft to debug it. (the function perft calculates the number of legal games of n moves in chess from a given position and a lot of engines support it). Uri
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.