Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: How to do my perft faster without 2 exe files and without doing movei

Author: Uri Blass

Date: 10:04:49 12/26/02

Go up one level in this thread


On December 26, 2002 at 12:47:07, Jeremiah Penery wrote:

>On December 26, 2002 at 06:32:09, Dave Gomboc wrote:
>
>>The run-time if and the compile-time #if are both better than the cut-and-paste.
>>
>>Dave
>
>I agree about the run-time if.  The compile-time #if seems silly, because it
>means he has to compile twice, and make separate .exe files.

Yes

There are also other silly things that I do

I do not do profile optimization and I use only optimize for speed so compiling
2 versions is not a problem.

I also guess that I do not check for bugs in a good way.

I have the following problem.

I added a line to my program that was not supposed to change the output but the
output was changed and I want to find the reason.

I found that one varaible was not the same after 1192598 nodes.
I want to find the first node that it was not the same.
I guess that there should be an easy way to do it but I do not know and simply
do a binary search when I every time ask both versions to print the varaible in
some nodes in an interval and look for 2 nodes in the interval when in the first
node the varaible is the same and in the second it is not the same.

Uri



This page took 0.01 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.