The Skewb Diamond is an octahedron which is bisected 4 ways, by planes in between and parallel to two opposite faces. Any face can be turned through 120 degrees in either direction, moving exactly half the puzzle. The puzzle consists of 8 triangular face centre pieces and 6 corner pieces.
The Skewb Diamond is closely related to the Halpern-Meier Pyramid (see Pyraminx) and the Skewb, which also have 4 axes of rotation. The six corner pieces of the Diamond correspond to the 6 edge pieces of the pyramid. The 8 face pieces of the Diamond correspond to the corners and faces of the pyramid, except that on the Diamond none of the face orientations are visible. Similarly, the six corner pieces of the Diamond also correspond to the 6 face pieces of the Skewb except that orientations are visible, and the 8 face pieces of the Diamond correspond to the corners of the Skewb but without visible orientations.
My solutions for the Skewb will also solve the Diamond. The solution below is slightly faster however.
Note that turning one face has the same effect on the puzzle as turning the opposite face the other way. Therefore the puzzle can be solved by only using one of each pair of opposite faces. Internally 4 of the face centres are fixed on axes, and the other 4 are moving pieces. Externally there is no visible difference between the two sets. In the solution below we will use only one of these sets and call these the fixed face centres, and the other faces are called the free face centres. This internal mechanism not only makes clear that the two sets of face centres cannot be mixed together, it also shows the corners have only two orientations.
There are 4 fixed faces, 4 free faces, and 6 corner pieces with 2 orientations giving a maximum of 6!·4!·26 positions. This limit is not reached because
This leaves 6!·4!·26/8 = 138,240 positions.
A computer search gave the following result:
Moves | Positions |
---|---|
0 | 1 |
1 | 8 |
2 | 48 |
3 | 288 |
4 | 1,632 |
5 | 8,568 |
6 | 36,114 |
7 | 74,799 |
8 | 16,547 |
9 | 220 |
10 | 15 |
Total | 138,240 |
This shows that any position can be solved in at most 10 moves (6.6921 on average). In Sloane's On-Line Encyclopedia of Integer Sequences this is included as sequence A079765.
Phase 1: Place the three top corners correctly.
Phase 2: Place the other three corners correctly.
Phase 3: Place the free face centres correctly.