Author: Uri Blass
Date: 12:04:26 04/24/03
Go up one level in this thread
On April 24, 2003 at 14:17:06, Uri Blass wrote: >On April 24, 2003 at 13:58:10, Will Singleton wrote: > >>On April 24, 2003 at 13:37:52, Uri Blass wrote: >> >>>On April 24, 2003 at 13:33:16, Will Singleton wrote: >>> >>>>Hi, >>>> >>>>I'm looking for a program that does perft without underpromotions. Thanks. >>>> >>>>Will >>> >>>modifying movei to do perft without under promotions is easy only changing one >>>line in the source code. >>> >>>Why do you need it? >>> >>>Uri >> >>I don't do underpromotions. I'd appreciate if you could send me the modified >>movei, thanks very much! >> >>Will > >I will send you it in the next few hours. > >I am now busy in writing my evaluation in a more convenient way to change and >testing for bugs by asking the program to compare new evaluation with old >evaluation and when they do not agree I know that I have bug in one of my >evaluation because they are supposed to be the same. > >Uri I sent it few minutes ago. I still did not finish finding bugs in the evaluation(I know that there are cases when the new evaluation is still not exactly like the old one but the case that I found was not a case that I expected) but I decided to change the program because the result of perft is not dependent on the bugs and I sent only a faster version that calculates perft and skip the parts that I change. 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.