Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Infinite analysis... bug?

Author: Uri Blass

Date: 15:34:28 02/20/05

Go up one level in this thread


On February 20, 2005 at 18:11:10, Dieter Buerssner wrote:

>On February 20, 2005 at 14:16:57, Jonas Cohonas wrote:
>
>>Isn't the actual counting of nodes universal for all engines? i mean couldn't
>>someone write the "once and for all node counting script" for all to freely
>>impliment?
>
>Jonas, it is not that complicated. But the natural way to do it would be to use
>64 bit variables. They are commonly available in modern systems. They are even
>standarized in C99. But many compilers do not support it in the standarized way.
>A multi-platform engine will need many code changes (no big deal, but lots of
>work, and when you are lazy ...).


I do not have a multi-platform engine because of lack of knowledge in
programming so I do not understand why you need many code changes.

Is not it possible to solve it by some replace?

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.

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

Uri



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.