|
%I #6 Dec 11 2013 07:08:09
%S 1,8,48,288,1728,9896,51808,220111,480467,166276,2457,32
%N Number of positions that are exactly n moves from the starting position in the Pyraminx puzzle.
%C This is the number of positions that can be reached in n moves from the start, but which cannot be reached in fewer than n moves.
%C A puzzle in the Rubik cube family. The total number of distinct positions is 933120. The trivial turns of the tips are ignored.
%C If tips are included the total number of positions is 933120 * 3^4 = 75582720.
%D Computed by John Francis and Louis Robichaud.
%D D. R. Hofstadter, Metamagical Themas, Basic Books, NY, 1985, p. 358.
%H Mark Longridge, <a href="http://cubeman.org/fullcube.txt">God's Algorithm Calculations for Rubik's Cube...</a>
%H Jaap Scherphuis, <a href="http://www.jaapsch.net/puzzles/">Puzzle Pages</a>
%K nonn,fini,full
%O 0,2
%A _N. J. A. Sloane_, Feb 20 2003
| 