Author: KarinsDad
Date: 10:29:47 07/12/99
Go up one level in this thread
On July 12, 1999 at 12:41:18, blass uri wrote:
[snip]
>>>>
>>>>#include
>>>>#include
>>>>main()
>>>>{
>>>>clrscr();
>>>>char x1,x2,x3,x4,x5,y1,y2,y3,y4,y5,i,j;
>>>>long double k,n=0;
>>>>long double m[65];
>>>>m[0]=1;
>>>>for (i=1; i> m[i]=m[i-1]*i;
>>>>for (x1=0; x1> for (x2=0;x2> for (x3=0;(x3> for (x4=0;(x4> for (x5=0;(x5> x1+x2+x3+x5> ;x5++)
>>>>{
>>>>k=m[x2]*m[x3]*m[x4]*m[x5];
>>>>i=0;
>>>>if (x2>2) i=i+x2-2;
>>>>if (x3>2) i=i+x3-2;
>>>>if (x4>2) i=i+x4-2;
>>>>if (x5>1) i=i+x5-1;
>>>>printf("%Lf\n",n);
>>>>for (y1=0; y1> for (y2=0;y2> for (y3=0;(y3> for (y4=0;(y4> for (y5=0;(y5> y1+y2+y3+y5> ;y5++)
>>>> {
>>>> j=0;
>>>> if (y2>2) j=j+y2-2;
>>>> if (y3>2) j=j+y3-2;
>>>> if (y4>2) j=j+y4-2;
>>>> if (y5>1) j=j+y5-1;
>>>> if ((i<=2*(15-y1-y2-y3-y4-y5)+(15-x1-x2-x3-x4-x5))&&
>>>> (j<=2*(15-x1-x2-x3-x4-x5)+(15-y1-y2-y3-y4-y5)))\
>>>> n=n+(m[48]/(m[x1]*m[y1]*m[48-x1-y1]))*(m[64-x1-y1]/\
>>>> (k*m[y2]*m[y3]*m[y4]*m[y5]*m[62-x2-x3-x4-x5-y2-y3-y4-y5]));
>>>> }
>>>>}
>>>>
>>>>printf("%Lf\n",n);
>>>>}
>>>>
[snip]
>some numbers:
>The upper bound:
>3.70106301212072366*10^46
>29 pieces on the board:2.18...*10^46
>28 pieces on the board 9.45...*10^45
>30 pieces on the board 4.58...*10^45
>
>Uri
Uri,
How exactly did you take into account promotions?
I am unclear on that from your code (I've always hated semi-cryptic c code).
KarinsDad :)
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.