Author: Angrim
Date: 01:44:52 10/30/00
Go up one level in this thread
On October 30, 2000 at 02:01:35, Jouni Uski wrote: >For my disappointment I noticed, that Goliath Light's (Chessbase) nodecounter >goes back to zero after 4 billion. This is pity, when in fast PC this happens >under 30 minutes! Of course this is minor problem, but are there better programs >in this respect? > >Jouni Just how fast a PC are you talking about? You need 2,386,092nps to wrap around a 32 bit node counter in 30 minutes! My suicide chess program uses a 64 bit node counter because I sometimes would leave it running for a few days on a position, and the node count would wrap a few times if I only used a 32 bit int. Note that it takes longer to increment a 64 bit int than a 32 bit int, especially on a 32 bit platform, and if you are doing it more than 2.3million times a second that could matter. Maybe thats why the really fast programs don't use a 64 bit node counter. Angrim
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.