Author: Dieter Buerssner
Date: 11:43:35 02/19/05
Go up one level in this thread
On February 19, 2005 at 14:16:43, Charles Roberson wrote: > When I commnent out 10 bytes of unused variables I get different > node counts in my benchmark only at 7ply or greater. > I do no mallocs or such, thus sounds to me like a bounds or stack > problem. > > Does anybody know a good bounds checker/ memory error detector that > runs in the cygwin envrionment or runs outside of it that doesn't need > to be instrumented into the binary???? Is your program written in C? For gcc there are bounds checking patches for the C-language (not for C++). I never tried to install them in the cygwin environment. They installed rather easily under Linux. One should assume, that one can also install them under Cygwin. One has tor recompile gcc. One other suggestion. Add some "tree dump" features to your engine. This can be useful for all kind of debugging problems. Then do a diff of the outputs of the two versions. With some work and patience, you should find out, what causes it (even when it is not some out of bounds access). With a 7 ply search, it should be possible to do a rather detailled tree dump (which for example could write a line at the entry of search, after calls to eval, after any move done, before any return point, etc.) Regards, Dieter
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.