Author: Bruce Moreland
Date: 00:03:07 12/27/02
Go up one level in this thread
On December 26, 2002 at 17:47:37, Uri Blass wrote: >Is there a fast way to find what is the first step that 2 similiar programs with >source code go different when you ignore specific part. > >I have 2 programs that are supposed to be the same except the fact that one save >time in order of moves. > >They are not the same. > >What I need is a third program that run the first 2 programs in the same time >and tell me the first step that they are different(difference in the procedure >that calculates order of moves does not count). > >I do not like to spend hours on trying to figure out the exact place that they >are different when after finding a place that they are different(can happen >after millions of nodes) I find again that they are different for different >unknown reason. > >This is exactly what happened to me now. > >Uri Set the program up to eat test suites. Make sure that the program returns to a base state between each problem. Set the program up to spit out node counts whenever it completes a ply. Write another program that knows how to compare the node counts, and set it up to honk and tweet when it encounters a difference. If you screw up, eventually the node counts will be different, and you'll hear honking and tweeting. If you detect that you've screwed up, systematically back out your changes to the new version until the node counts are the same. Understand why the code change made the node counts different. bruce
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.