Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Infinite analysis... bug?

Author: Dieter Buerssner

Date: 15:11:10 02/20/05

Go up one level in this thread


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 could give some examples, that shows this.
When you are not a programmer, I fear you could hardly appreciate it. And of
course, you just could (and should) think of it as an engine bug. The author
might think of it as a feature (that only is some aesthetical problem). The old
way of using the overflowing 32 bit counters works everywhere without any
problem.

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.