Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: root search ordening

Author: Gian-Carlo Pascutto

Date: 08:50:01 05/02/01

Go up one level in this thread


On May 02, 2001 at 11:46:52, Paul wrote:

>Right ... not surprisingly, I've had exactly the same problem! :) So what did
>you do to solve this? Use a double or a 64 bit int?

I divided my nodecounter by 100 before using it for sorting.

I haven't seen it actually overflow yet, my program is pretty slow and I
don't run analysis so I can live with 32-bits for now.

If it does bother you, I'd use long long/uint64.

--
GCP



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.