Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: measuring search efficiency--ideas?

Author: Tom Likens

Date: 09:51:28 05/24/00

Go up one level in this thread


On May 23, 2000 at 23:40:50, Christophe Theron wrote:

>Yes, I have this too. When I change something, even a single line, I run a test
>and look at the total number of positions seen. If it is different, either I
>know why (the change in tree size was expected) and it's OK, or I don't know why
>and it's likely a bug.
>
>The next step in this case is to use my tree dump utility. It allows me to
>compare the trees searched by two different versions, and to point me exactly
>where the searches forked. Then it is very easy to find what the problem is.
>
>It has been especially useful when I ported my code from GCC to VC. The number
>of nodes computed by the 2 versions were different, and without this tool it
>would have taken me several days to find what the problem was. With the tool I
>have been able to fix it in 1 hour.
>
>
>    Christophe

This is interesting, were the problems between the two versions related
to compiler issues or did you have to actually translate the GCC version
to Windows (thus introducing the bug in the translation process)?

--Tom




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.