Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Any idea's on how long it takes to learn C++, then create a chessmonster

Author: Dann Corbit

Date: 15:34:51 12/10/01

Go up one level in this thread


On December 10, 2001 at 18:25:12, David Hanley wrote:

>On December 10, 2001 at 18:06:36, Dann Corbit wrote:
>
>>On December 10, 2001 at 17:49:00, David Hanley wrote:
>>[snip]
>>>In my program i'm doing now, the bounds checking alone has saved me from bugs
>>>quite a few times.  My program plays correctly, if very weakly, but it think it
>>>would have taken me at least 3x as long in C--and i'm a published author on C!
>>
>>There are lots of bounds-checker tools for C that will instantly find problems
>>of that sort.
>
>Those may have progressed since i used them last, but they didn't catch
>everything when i least used them, particularly off-by-one errors.
>
>It is true that in C++ you could introduce bounds-checked arrays.
>
>Still not the same!

No, I mean run time bounds checking.  There are lots of tools that allow this.
For instance, look here (old article):
http://www.microquill.com/prod_ha/ha_comp.htm

More recent data on BoundsChecker (the one I like best):
http://www.compuware.com/products/numega/dps/vc/index.htm

You detect problems with a debug compile, and then when you do a release build,
you get the full speed back.



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.