Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Infinite analysis... bug?

Author: Dieter Buerssner

Date: 15:40:54 02/20/05

Go up one level in this thread


On February 20, 2005 at 18:34:28, Uri Blass wrote:

>Is not it possible to solve it by some replace?

It should be possibe, by some search/replace. "some" could be rather many.

>If the problem is only in printing information then the question is how many
>times in your code you print something that is related to the number of nodes.

I guess, around 100 (especially in debug code, that is not compiled in, in the
released engine. But all occurrancies would need to be fixed. Really simple
search/replace will not handle it).

>Do you think that finding the information and replacing is something that should
>take more than few hours for you.

More than one hour, for sure. How many, I am not sure. If it only were one hour,
probably any engine author would have fixed it.

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.