Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Interesting numbers about hashing - 32 bits are clearly not enough

Author: Uri Blass

Date: 22:46:57 12/06/01

Go up one level in this thread


On December 07, 2001 at 00:22:19, Miguel A. Ballicora wrote:

>On December 07, 2001 at 00:20:18, Miguel A. Ballicora wrote:
>
>sorry, I pressed enter too early
>
>int64tostring (long long x, char *s)
>{ unsigned int a = x/1000000;
>  unsigned int b = x%1000000;
>  if (x>1000000)
>     sprintf(s,"%d%d",a,b);
>  else
>     sprintf(s,"%d",b);
>  return s;
>}
>
>then you use
>
>long long x;
>char buffer[64]
>printf("nodes: %s\n",int64tostring(x,buffer));
>
>Miguel

I may try it
Here is my way to print long numbers(I needed it to print perft 8 from the
initial position when mone is perft 8)


printf("      %d",mone/1000000);
	mone=mone-1000000*(mone/1000000);
	if (mone<100000) printf("0");
	if (mone<10000) printf("0");
	if (mone<1000) printf("0");
	if (mone<100) printf("0");
	if (mone<10) printf("0");
	printf("%d",mone);

Uri



This page took 0.01 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.