Discussions on the mathematics of the cube

Kilominx can be solved in 34 moves

Last night, I found this thread on the speedsolving forums which proves an upper bound of 46 moves. First, the puzzle is separated into two halves, which takes at most 6 moves. Each half is then solved in at most 20 moves (= 7 moves for orientation + 13 moves for permutation, after orientation is solved), for a total of 6+2*(7+13) = 46. xyzzy writes
The ⟨U,R,F⟩ subgroup, while much smaller than G_0, is still pretty large, having 36 billion states. It's small enough that a
full breadth-first search can be done if symmetry+antisymmetry reduction is used, but I will leave this for another time.

5x5 sliding puzzle can be solved in 205 moves

Consider a 5x5 sliding puzzle with the solved state
 1  2  3  4  5
 6  7  8  9 10
11 12 13 14 15
16 17 18 19 20
21 22 23 24   
We can solve the puzzle in three steps. First solve 1,2,3,4,5,6,7, then solve 8,9,10,11,12,16,17,21,22, and finally solve the 8 puzzle in the bottom right corner. Step 1 requires 91 moves:
depth   new             total
0       18              18
1       6               24
2       13              37
3       27              64
4       54              118
5       117             235
6       231             466
7       443             909

God's algorithm for the <2R, U> subset of the 4x4 cube

Here I'm using sign notation, so 2R is the inner slice only. There are 10 edges, 10 centres in sets of 2, 2, 2 and 4, and 4 permutations of the corner pieces for a total of 4*10!*10!/(2!2!2!4!) = 274,337,280,000 positions. From July 4th 2017 to July 6th 2017, I ran a complete breadth first search of this puzzle in around 60 hours. God's number is 28.
Depth   New            Total
0       1              1
1       6              7
2       18             25
3       54             79
4       162            241
5       486            727
6       1457           2184
7       4360           6544

Do we have a 3x3x3 optimal solver for stm metric?

I thought it might be interesting to run an optimal solver using the slice turn metric (including face turns) on some pretty patterns. I don't remember anyone releasing an optimal solver that uses stm but maybe there is one by now?

Also is it true we don't know if using slice turns plus face turns could reduce God's Number from 20 to less than 20?

More details about my new program

Introduction

On 02/23/2016, I posted a message about a new program I had developed that had succeeded in enumerating the complete search space for the edges only group. It was not a new result because Tom Rokicki had solved the same problem back in 2004, but it was important to me because the problem served as a testbed for some new ideas I was developing to attack the problem of the full cube. I am now in the process of adapting the new program to include both edges and corners. In this message, I will include some additional detail about my new program that was not included in the first message.

Pattern databases for the 5x5 sliding puzzle

In 2002, Korf and Felner [1] used pattern databases to solve optimally 50 random instances of the 5x5 sliding puzzle. They used a static 6+6+6+6 partition of tiles (described below), along with its reflection in the main diagonal. In a 2004 paper by Felner, Korf and Hanan [2], the authors describe in a footnote the way they handled the empty tile as 'not trivial'; the empty tile was taken into account when precomputing the database, but then the tables were compressed by discarding the information about the empty location. The authors do not provide the distribution of values from the pattern databases, but do provide maximum values and the number of nodes generated when solving random instances of the 5x5 sliding puzzle.

A cubic graph with cubic diameter

The Fifteen puzzle is sometimes generalized to a sliding puzzle on an arbitrary simple connected graph G with n vertices in the following way. n − 1 movable pieces numbered 1, 2, ... (n − 1) are placed on vertices of the graph G. At most one piece is placed on each vertex. One vertex of G is left unoccupied. A move consists in choosing a vertex v adjacent to the currently unoccupied vertex v0 and 'sliding' the piece at v along the edge (v; v0). The aim is to restore the order so that piece numbered i occupies vertex numbered i, for i = 1 .. n − 1. In the case of the Fifteen Puzzle, the underlying graph G is the 4 × 4 grid graph, and a degree-2 vertex is left unoccupied in the goal configuration.

Is there a way to evenly distribute face turns for 12 flip?

Back in Jan 1995 Mike Reid found this process for the 12 flip:

R3 U2 B1 L3 F1 U3 B1 D1 F1 U1 D3 L1 D2 F3 R1 B3 D1 F3 U3 B3 U1 D3 24q

This process has 24 q turns, so I'm wondering could there be a 24 q turn process that evenly distributes the turns so that each side turns 4 q? The idea just seemed elegant to me, 6 faces each turning 4 q turns.

Mark

Super Group Cosets of the Centers Subgroup

Continuing my work with the 3x3x3 super group, I have written a coset solver for cosets of the pure center cubie subgroup. This subgroup is made up of the 2048 even parity center cubie configurations composed with the identity edge and corner configurations. The super group may be partitioned into cosets of the pure centers subgroup, g * [CTR] , where g is an element of the super group and [CTR] is the centers subgroup. The centers subgroup is a normal subgroup of the super group, g * [CTR] = [CTR] * g, and the standard cube group is the quotient group of the super group and the centers subgroup.

Finally hitting depth 13 consistently with my 5x5x5 solver



It finally occurred to me why my hash table was sometimes not finding the shortest solutions 100% of the time. When I upgraded my computer to one with 128 GB of RAM, I had enough to load more positions into RAM. The number of hash table entries exceeded 4.2 billion, which is more than 32 bits. I never adjusted all of my access code to use 64-bit indices which were now necessary. All I had to do was change the data type, and, lo and behold, it found a 13-move solution to this arrangement, which previously it was reporting required 14 moves!

A very happy day for me.