## Starts-with and Ends-With

Submitted by Jerry Bryan on Thu, 12/21/2006 - 16:12.On the old Cube-Lovers list, the terms Starts-with and Ends-with were defined as follows. For a cube position x, StartsWith(x)=S(x) is the set of all moves with which a minimal maneuver can start and EndsWith(x)=E(x) is the set of all moves with which a minimal maneuver can end.

The concept is much older than Cube-Lovers, of course. It's obvious that from any position except for Start itself, there must be at least one move which takes the Cube closer to Start. The set of all such moves is simply the set of inverses of E(x).

## God's Algorithm, Face Turn Metric, Out to 11 Moves from Start

Submitted by Jerry Bryan on Thu, 11/30/2006 - 22:23.Distance Patterns Unique Positions from up to Symmetry Start 0 1 1 1 2 18 2 9 243 3 75 3240 4 934 43239 5 12077 574908 6 159131 7618438 7 2101575 100803036 8 27762103 1332343288 9 366611212 17596479795 10 4838564147 232248063316 11 63818720716 3063288809012

## Solving the 4x4x4 in 85 twists

Submitted by Bruce Norskog on Wed, 11/29/2006 - 00:45.In my posting titled "The 4x4x4 can be solved in 79 moves (STM)," I reported about an analysis I did where the 4x4x4 cube is solved in five stages. In that analysis, a move was considered to be any quarter-turn or half-turn of a single slice.

I have now completed a similar analysis of the 4x4x4 cube where a move is considered to be any quarter- or half-turn twist of the cube, and where a twist is considered to be one portion of the cube (a face layer, or a block consisting of a face layer and the adjacent inner layer) being turned with respect to the rest of the cube. The analysis indicates that any valid position of the 4x4x4 cube can be solved via these five stages using no more than 85 twists.

## Some Thoughts on Representing the Cube

Submitted by Jerry Bryan on Tue, 11/21/2006 - 00:34.I wanted to post a number of miscellaneous items about representing the cube, and I will also include a few other related items.

I'll start with the group S_{3} as an example.
I will treat the group S_{3} as acting on the
set {0, 1, 2}. As I have been
doing recently, I'll use the notation (a b c) to represent the
permutation 0→a, 1→b, 2→c.

In this notation, the entirety of S_{3} can be listed as
follows:

(0 1 2) (0 2 1) (1 0 2) (1 2 0) (2 0 1) (2 1 0)

This basic idea, or something very similar to it, is probably the way
most people represent the cube in a computer program.
Variations on the
theme could include an S_{54} model, an S_{48} model,
an S_{24} × S_{24} model, and some sort of wreath
product model. The most common wreath product model would probably
be something like (S_{8} wr C_{3}) ×
(S_{12} wr C_{2}). In the wreath product model,
S_{8} and S_{12} represent the corner cubies and the
edge cubies, respectively, and C_{3} and C_{2}
represent the twists of the corner cubies and the flips of the edge cubies,
respectively. Of course, none of these various models are isomorphic
to the cube group. Rather, the cube group is a subgroup of
whatever group is chosen as the computer model.

## Solving the Rubik's Cube in Sub 13 Algs, BLD!

Submitted by Dbeyer on Sat, 07/29/2006 - 06:08.This is an advanced version of Pochmann, the method has three key steps.

Solve the F/B face + 1 S Edge (the UL as Default)

Roux Cycle the last three edges

Parity Fix.

The parity is something common in bld, so most of you will laugh at this. My method never encounters the 2 Corner 2 Edge swap parity, because that's what my system is based on.

It's something that 4 Step Solvers encounter, and they deal w/ it first.

## How to Compute Optimal Solutions for All 164,604,041,664 Symmetric Positions of Rubik's Cube

Submitted by silviu on Thu, 07/27/2006 - 17:07.have successfully found optimal solutions to all symmetric positions

of Rubik's cube in the face turn metric (FTM). Furthermore we have

maneuvers for 1,091,994 20f* (positions whose optimal solutions

have 20 face turns) cubes and proven that there are no symmetric

21f* cubes. So if there are any cubes at depth 21 then these must

be unsymmetrical. To the best of our knowledge, at the start of this

investigation in January, only a few such positions were known (less

than a dozen). Expressions for all these cubes can be found on

Rokicki's home page http://tomas.rokicki.com/all20.txt.gz.

## The 4x4x4 can be solved in 79 moves (STM)

Submitted by Bruce Norskog on Sun, 07/09/2006 - 18:38.I have done a five-stage analysis of the 4x4x4 cube. My analysis considers the four centers for each face to be indistinguishable. It also assumes that there is no inner 2x2x2 cube in the middle of the cube.

Like Morwen Thistlethwaite's well-known four-stage 3x3x3 analysis, my five-stage procedure consists of multiple stages where each successive stage only allows use of a subset of the moves allowed in the previous stage, with the final stage only allowing half turns. So far, I have completed analyses of the five stages using the slice turn metric (STM). Use of other metrics is possible. (In fact I have done some other metrics for some of the stages.) My analyses for each individual stage are optimal with respect to the specified move restrictions for each stage. The results indicate that the 4x4x4 can be solved using a maximum of 79 slice turns.

## Suboptimal solvers for the 4x4 and 5x5 cubes?

Submitted by Werner Randelshofer on Thu, 06/29/2006 - 14:15.I am pondering about prepending a third phase to Kociemba's two-phase algorithm for the 3x3 cube. The initial phase performs two-layer twists on a 4x4 cube or a 5x5 cube until the stickers on the edge parts and on the side parts line up to form a 3x3 cube. Then Kociemba's two phase algorithms takes over and solves the 3x3 cube.

Does anyone have experience with such an algorithm? I currently don't know how to create the pruning tables for the initial phase. Also I am not sure, if my approach will work at all.

## Using latex2html utility for posting

Submitted by cubex on Thu, 06/15/2006 - 08:59.Test

The files would have to be hosted somewhere but this would provide a way of handling all those mathematical symbols although no doubt some minor hand-turning would be necessary.

Mark

## the search for a 21f, an idea for some candidates

Submitted by WarrenSmith on Sat, 05/20/2006 - 18:59.you only look at edges and ignore corners - it was found by J.Bryan and

is all edges flipped in place, composed with a mirror reflection of the whole

cube.

That suggests, taking this one edge position and exploring all possible configurations

(there are about 3 million) of the 8 corners to get 3 million cube positions.

If you are seeking a cube configuration with 21f or more distance to start,

these 3 million candidates seem tolerably likely to include a winner.

Because 3 million is a lot of searching, you might try a cheaper approach like just