Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Extreme move path enumerations

Author: Steven Edwards

Date: 05:51:09 08/22/03

Go up one level in this thread


On August 22, 2003 at 08:38:15, Andreas Stabel wrote:

>On August 22, 2003 at 05:28:17, Steven Edwards wrote:
>
>>Consider the following rather simple position:
>>
>>[D]4k3/8/8/8/8/8/8/4K3 w - -

...

>>Depth: 23
>>count: 8934501555889985874
>>Total: eight quintillion nine hundred thirty-four quadrillion five hundred one
>>trillion five hundred fifty-five billion eight hundred eighty-nine million nine
>>hundred eighty-five thousand eight hundred seventy-four
>>Frequency: 7.97725 EHz
>>Period: 125.357 zs
>>Cycles per node: 1.00285e-10
>>Clock: one second
>>
>>After a depth of twenty-three, the count for the above position spills a
>>sixty-four bit integer.  I suppose I'll have to include a bignums class :)
>
>If it is of any value - I can confirm the above numbers with my program.
>Also your numbers for the first 9 plys of the initial position.

Work on the ten ply move path count from the initial array continue.  The first
eight subtree counts are:

Na3: 2440848135252
Nc3: 3096505857746
Nf3: 3090773583680
Nh3: 2470483499345
a3: 2149477156227
a4: 2905552970419
b3: 2774842822463
b4: 2772533545113




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.