ROKICKI, KOCIEMBA, DAVIDSON, AND DETHRIDGE

Table 5.1
The count of canonical sequences of length d and positions at distance d. Note how close the
values are through d = 16. The count of cube positions at distance 15 is a new result from this work.
The approximate values are from [21] and [20].
d Canonical sequences Positions
011
1 18 18
2 243 243
3 3,240 3,240
4 43,254 43,239
5 577,368 574,908
6 7,706,988 7,618,438
7 102,876,480 100,803,036
8 1,373,243,544 1,332,343,288
9 18,330,699,168 17,596,479,795
10 244,686,773,808 232,248,063,316
11 3,266,193,870,720 3,063,288,809,012
12 43,598,688,377,184 40,374,425,656,248
13 581,975,750,199,168 531,653,418,284,628
14 7,768,485,393,179,328 6,989,320,578,825,358
15 103,697,388,221,736,960 91,365,146,187,124,313
16 1,384,201,395,738,071,424 ≈1,100,000,000,000,000,000
17 18,476,969,736,848,122,368 ≈12,000,000,000,000,000,000
18 246,639,261,965,462,754,048 ≈29,000,000,000,000,000,000
19 3,292,256,598,848,819,251,200 ≈1,500,000,000,000,000,000
20 43,946,585,901,564,160,587,264 ≈300,000,000
Table 5.2
Search time for one coset of H up to a given depth, count of sequences with n moves from S
followed by m moves from A, time for m prepass operations, and total time (prepass plus search).
Note how the total time increases much more rapidly than the sequence count as n increases past 15.
n Search time m qn,m(S,A) Prepass time Total time
14 0.14 seconds 6 8.10 × 1020 18.6 seconds 18.7 seconds
15 1.9 seconds 5 1.59 × 1021 15.5 seconds 17.4 seconds
16 25 seconds 4 3.13 × 1021 12.4 seconds 37.4 seconds
17 5.6 minutes 3 6.18 × 1021 9.3 seconds 5.8 minutes
18 1.2 hours 2 1.21 × 1022 6.2 seconds 1.2 hours
19 16 hours 1 2.44 × 1022 3.1 seconds 16 hours
20 9 days 0 4.39 × 1022 0 9days