Author: Eric Oldre
Date: 09:09:57 06/16/05
Go up one level in this thread
On June 15, 2005 at 16:36:54, Eric Oldre wrote: > >I was wondering if anyone would like to volunteer any tricks they've >used to help find certain bugs in their search function. > >I think that the ideas of using perft for move generation and >reversing the board to find bugs in the evaluation have both >been really useful to me. I was wondering if anyone has used >techniques similar to these to help find search bugs. > >I understand that just because a engine can properly pass these >and other tests doesn't mean it's free of bugs. But they certainly >help detect at least some of them. > >I'm certain that there must be plenty of bugs in Latista's search >and I think it's time for me to work on discovering them. If >you don't have any automated tricks like above. Does anyone >have any general advise to help me spot some bugs? > >Eric Oldre > >PS. I have at various spots in my program tried to follow a similar >model of asserts as in fruit. I'm sure taking some time to >do this at more parts of my program would help. Thanks to everyone to has responsed so far. I've picked up quite a few ideas here that it will take me some time to implement! when using a ASSERT scheme similar to fruit's where it logs the file and line of the failed assertion, using __FILE__, and __LINE__. Is there any programatic way to access the call stack? What tools exists for doing buffer overflow checks? I'm using VS.Net 2003 for my dev environment. I'd like to make sure that if I have a char x[10] that i'm never stuffing more than 10 bytes into it using strcat etc. I realized both of these questions are because I'm pretty new to C/C++ programming. So please excuse my ignorance on these subjects. Thanks, Eric
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.