Author: J. Wesley Cleveland
Date: 13:21:19 08/19/00
Go up one level in this thread
On August 19, 2000 at 15:49:06, tony worsman wrote: >Hi All, > >When testing Crafty on a position using long time controls, I've noticed that >the node counter reaches 4-5 billion, but never goes beyond this number, but >decreases giving a false nps. As the search does not appear to be affected >by this behaviour, It is not really a problem. > >Is this a limitation of 32 bit computers, Crafty, or the C language, not sure, >I'd be interested to know the answer. [snip] The problem is that the C Language does not define a standard 64 bit int type, and there is no simple compatible way to print a 64 bit int. One possible solution would be to cast it to a double and print that.
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.