- ... domain
^{1}
- The two largest fifteen puzzle problem instances were
not included due to the amount of time required to generate this data for
these problems.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

- ...[25].
^{2}
- Because of time constraints, we estimated the serial run time for the
two largest fifteen puzzle problem instances using the number of required node
expansions for these problems published in Korf's paper and the
mean node expansion time averaged over the next five largest problem instances.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.