Discussions on the mathematics of the cube

5x5 puzzle: Comparison between reduction chains (STM, 10000 instances)

The multi-chained approach used in kumi na tano allows to use multiple search chains at the same time. The main advantage is that the best chain can be choosen depending on the instance to be solved, rather than hard-coded into the search algorithm.

For example, the first of the following two 5x5 instances has its leftmost column solved, while second has solved four tiles in top-right corner.

[1]
  1 17  9 10 18    18  3 16  4  5
  6  0  2  3  8    11  7 17  9 10
 11  5 22  7  4    19  2 23  0 21
 16 15 20 23 13     6 20 14 12  1
 21 19 12 14 24    13  8 15 22 24

We cah use multi-chained approach here. The following two partitioning schemes:

One Million Random Twenty-Four Puzzle Instances in the STM metric

I have solved sub-optimally 1,000,000 random instances of 5x5 sliding tile puzzle in STM metric (single-tile moves). The actual running time was about 18,5 hours. The minimum, maximum and average solution length were 73, 171 and 124.48 moves respectively. About 52% of 1,000,000 solutions were in range [118; 132]. There were only 32 instances with (suboptimal) solution length less than 81 (range [73; 80]). Only one instance was solved in 171 moves.

Sliding tile puzzle suboptimal solver

Hello all.
I wrote a program capable to solve (MxN-1) sliding tile puzzles, such as the Fifteen puzzle. The program can solve puzzles from 2x2 to 11x11.
The main thread is on Speedsolving.com:
http://www.speedsolving.com/forum/showthread.php?38689-kumi-na-tano-3-00-sliding-tile-puzzle-suboptimal-solver
- Bulat

Policy Change for New Accounts

Due to the constant spamming I have changed the access rules for new accounts. From now on new users must email cubexyz at gmail dot com and explain why they want an account here. A short note on your specific interests on Rubik's Cube and math should be sufficient.

Also the ban on gmail has been lifted. Sorry for the trouble, but deleting spam entries got tiresome.

Mark

Megaminx needs at least 45 moves

Surprisingly, nobody seems to have done anything else as a rough analysis of the number of moves to solve the Megaminx puzzle, especially no analysis which includes the commutativity of some moves.

A Hamiltonian circuit for Rubik's Cube!

I have found a Hamiltonian circuit for the quarter-turn metric Cayley graph of Rubik's Cube! In fact, it only uses turns of five of the six outer layers of the cube.

In more basic terms, this is a sequence of quarter moves that would (in theory) put a Rubik's cube through all of its 43,252,003,274,489,856,000 positions without repeating any of them, and then one more move restores the cube to the starting position. Note that if we have any legally scrambled Rubik's Cube position as the starting point, then applying the sequence would result in the cube being solved at some point within the sequence.

Regularities in maximum WD values

Regularities in maximum WD values

This post is about any mathematical laws inside the Walking Distance heuristic. It seems like WD is not just puzzle to be computed. Maybe the whole WD heuristic is some math structure.

A Hamiltonian Circuit for the 2x2x2

I have found a Hamiltonian circuit for the 2x2x2 cube group (3674160 elements). I have posted the solution on the speedsolving.com forum. Link: http://www.speedsolving.com/forum/showthread.php?34318

Number of canonical move sequences for nxnxn Rubik's cube in q-w metric

Quarter turn metric is more difficult to handle than h-w metric, because the 180 degree turn has to be counted as two moves, which gives some issues with an recursive approach. I did not believe it was possible to get a simple formula here. I was very surprised, that the result was a simple generating function for the number of canonical sequences in q-w-metric. It is

gfq[n_,x_]:=3/(6-4(x+1)^(2(n-1)))-1/2

and looks very similar to the generating function in h-w metric which is

gfh[n_,x_]:= 3/(6-4(3x+1)^(n-1))-1/2

Number of canonical move sequences for nxnxn Rubik's cube in h-w metric

In h-w metric, a move of the nxnxn cube is a 90 or 180 degree turn of a face together with 0..n-2 adjacent slices. When counting the canonical move sequences the commutativity of the moves on one axis has to be taken into account. The number of canonical move sequences can be computed quite elegantly using matrices