## Approximation formula for the lower bounds of nxnxn cube in slice turn metric

Submitted by kociemba on Wed, 08/03/2011 - 17:40.## Twenty-Four puzzle, some observations

Submitted by stannic on Sun, 07/24/2011 - 01:39.Hello all. I am new on this great forum. My first post is about Twenty-Four puzzle, larger version of classic Fifteen. I walked around sliding tile puzzles for quite some time. At some point I decided that what I have is too much for me alone, but enough to write about it here.

Many small puzzles have been solved long ago. There is some information in OEIS: A151944 (about MxN puzzles), A087725 (about NxN puzzle). AFAIK largest solved STP is 4x4 puzzle (classic Fifteen). It was known that 80 single-tile moves required and sufficient, and recently Bruce Norskog wrote on this forum about 43 multi-tile moves.

## Optimal Void Cube Up Face Odd Parity Maneuvers

Submitted by B MacKenzie on Wed, 07/20/2011 - 13:20.When solving the void cube one encounters odd position parity positions as the cube approaches being solved. The last step for me is to solve the Up face corners and this is where I encounter odd permutations. Corners first solvers may encounter an odd permutation of the Up face edges. The question is what is the shortest maneuver which will convert an odd permutation of the Up face corners into an even permutation of the Up face corners leaving everything else unchanged. This is regardless of the effect on the corner twist. Likewise, what is the shortest maneuver which will convert an odd parity up face edge permutation to an even parity permutation regardless of the edge flip?

## Lower Bounds for n x n x n Rubik's Cubes (through n=20) in Six Metrics

Submitted by rokicki on Mon, 07/18/2011 - 22:12.technique to compute a lower bound on God's Number. This technique

considered the maximum number of positions that can be reached by what

is called "syllables"---consecutive moves on the same axis, possibly

turning distinct faces. Since all the moves that make up a syllable

commute, we can select a single canonical move sequence to represent

every syllable, and then determine how many move sequences of a given

total length can be made out of only these syllables. This gives a

more accurate bound on God's Number because it eliminates many

## Number of 4x4x4 positions for up to 5 moves

Submitted by Bruce Norskog on Sun, 07/10/2011 - 20:35.After hearing about this paper which talks about the size of God's number for nxnxn cubes, I was thinking about what we currently know about God's algorithm for the 4x4x4 and realized that I couldn't seem to find any partial distance distributions on the 4x4x4 on the web.

So I've run my own analyses to get the number of positions up to 5 moves from the solved state. I have done this for six metrics. First, I have "single-slice" metrics where a move is only allowed to turn a single layer. Second, I have twist metrics where a move is only allowed to twist the cube along one plane. This is sometimes called face-turn metric because a face layer (possibly along with additional adjacent layers) is (are) turned with respect to the rest of the cube. Finally I also used what I termed "block turns" where some block of one or more adjacent layers (not necessarily including a face layer) are turned with respect to the rest of the cube. For each of these, I also considered whether or not a move must be restricted to quarter-turns only.

## An Alternate Universe of the Cube

Submitted by cubex on Tue, 07/05/2011 - 08:04.I've been meaning to explore new variations on the 3x3x3 cube for a while and I think I've come up with something new.

If we consider the rotation of a 2x2x2 block as one move, say the UFR block, and call it the z-move for lack of a better name. Now all sorts of weird stuff becomes possible, e.g. (z, C_U2)^6 will generate a 5-spot pattern! The centres cycle (U,L,R,B,F) in befuddler notation.

So in this particular universe of the 3x3x3 cube we are considering 8 corner moves which move a 2x2x2 block rather than the usual 6 face moves. I won't spoil all the fun, but a 3-spot, 4-spot and 6-spot are possible and these spots patterns are quite different from what is possible in the 'normal' universe of the cube.

## A Curiosity

Submitted by B MacKenzie on Fri, 06/24/2011 - 10:25.Playing around with an optimal slice turn solver of mine, I found two turn sequences which are identical except for two turns which are swapped:

R U2 R MU2 MF L' MU' L2 B2 R MU2 MF L U2 R MU2 R U2 R MU2 MF L' MU' L2 B2 R MF MU2 L U2 R MU2

The first gives superflip and the other gives the 26 q-turn hermit position—superflip composed with a four spot pattern. I don't know what if any significance this has, but I find it remarkable.

## Three Million Random Positions in the Quarter Turn and Half Turn Metric

Submitted by rokicki on Sun, 06/05/2011 - 18:51.12h 13h 14h 15h 16h 17h 18h 19h sum 14q - 1 2 - - - - - 3 15q - 4 19 13 - - - - 36 16q 1 11 47 124 126 - - - 309

## NxNxN cubes in GAP

Submitted by Bruce Norskog on Mon, 03/21/2011 - 19:23.Since defining GAP definitions for large cube sizes can be very tedious, I have implemented some GAP code for defining NxNxN cubes. The main function is called GenCube and returns a group representing a cube of the size specified by the parameter n. This function has a 2nd parameter (center_ori) used for odd cubes that allows specifying whether or not you wish to have the orientation of the most central pieces on each face to be considered significant.

The code uses a face-based numbering system. The facelets on the U face are numbered 1 to n^{2}, the L face uses numbers n^{2} + 1 to 2n^{2}, and the remaining faces are similarly numbered in the order F, R, B, D. For handling orientation of the most central pieces on each face, 18 additional numbers are used, starting at 6n^{2} + 1.

## Optimal parity fix maneuvers on the 4x4x4 cube

Submitted by Bruce Norskog on Mon, 03/14/2011 - 21:09.I recently investigated optimal reduction parity fixes on the 4x4x4 cube.

First some explanation of terms. A common strategy used in solving the 4x4x4 cube is to solve the center pieces, and then pair up the 12 pairs of edge pieces. The puzzle can then be solved like a 3x3x3 cube by turning only the face layers, except for two possible types of parity conditions that can't normally occur on the 3x3x3. These parity conditions are often called *OLL parity* and *PLL parity* (since whether or not these parity conditions are present typically isn't recognized until attempting to solve the last layer). Since the 4x4x4 is "reduced" to a pseudo-3x3x3 cube, this strategy is generally referred to as *reduction*.