I am working on a Design project with 3 other 2nd year Engineering students from Canada, as well as a 2nd year Computer Science major. We are planning to build a robot that can take a scrambled Skewb puzzle and solve it. We've been working on this project for 3 or 4 months now, and are hoping to have a prototype completed by the end of March.

I made this forum post so that I could post some updates on our progress, ask peoples opinions, and form polls. Any discussion is welcome...

Skewb Solving Robot]]>

Converting algorithms to letters?]]>

Thanks!]]>

In its solved state all colors and numbers only represented once per face.

A virtual model of this cube can be found on this page:

A total of 21 additional solutions (apart from the initial state of the cube) have been found so far.

But we are convinced that there are many more ... so therefore, our...

How many 8 Color Cube solutions are there?]]>

Let's say you have a cube simulator that allows a limited number of macros (algorithms and triggers) and functions (invert and mirror).

You could use functions to modify any macro

A macro could be executed instantaneously.

So the question is:

What times could be achieved by using moves, functions and a limited number of macros?

What would be the optimal number of macros, maybe 30? Roux cmll and some triggers for blockbuilding and lse?

I want to know what...

Solving with macros and functions]]>

I am ask for help.

I am a beginner of Rubik, I hope to write a python program for the following robot.

I use the ptyhon package from here:

https://github.com/muodov/kociemba

example...

Can kociemba or other method solve the Rubik in 5 faces turn only?]]>

Now I would need a V-Perm to swap the FLU corner with the RBU corner and the LU edge with the BU edge. I cannot break down the common V-Perm algorithms to a commutator. My question is, is it possible to find a commutator which does basically the same as a V-Perm? If not how would I solve this cube using only commutators?

Er, what exactly do you want to accomplish...

Is it possible to find a commutator for a V-Perm]]>

The title is a little general, but it should be, as I have a lot to share about forming several types of 2-cycle inner-layer odd permutation algorithms.

To begin, why not start with the "Pure Edge Flip" (my favorite, obviously).

I would first like to show you how to derive common OLL parity algorithms by hand. To do this, I have taken the time to make tutorial videos for three popular algorithms. Each of the three algorithm's derivations are two videos long.

*Note...*

To begin, why not start with the "Pure Edge Flip" (my favorite, obviously).

I would first like to show you how to derive common OLL parity algorithms by hand. To do this, I have taken the time to make tutorial videos for three popular algorithms. Each of the three algorithm's derivations are two videos long.

Methods for Forming 2-Cycle Odd Parity Algorithms for Big Cubes]]>

On a 3×3×3 and related puzzles (e.g. big cubes), there is a considerable amount of variety in the types of subgroups generated by face moves. (We will not consider generating sets with move sequences longer than...

Megaminx "half turn subgroups" <U, R2> and <U, R2, F2>]]>

Hey! Any ZZ solvers? Would you mind filling this out? https://goo.gl/forms/1ROTK68T9AFI1Lny2]]>

I study the period of algorithms.

Let A be an algorithm. A is "k-periodic" if A^k (A repetead k times) is the equivalent of doing nothing.

For instance, (RUR'U') is 12-periodic, 36-periodic, and its smallest period is 6.

I'm searching algorithms whose smallest period is 11 and whose height (HTM) is as small as possible.

Currently I found this one (with a program), its height is 10 :

D' L R' F U' R U' D F' L

But maybe...

Wanted: 11-periodic optimal algorithm]]>

I'm in the seek of all the 5 edge commutators (EO preserve preferably) like this one:

R2 F2 R2 U' x 2

(all the cycle shifts are already taken into account)

So if you have any commutator (8 mover or fewer even better) is really well appreaciated.]]>

Then there is all the methods which do corners first (or edges first) like most of the bld methods.

Then there is all of the fmc approaches.

But then there is the question how Roux fits into this...

Thats my view on this. What do you think? How would you group the methods?]]>

It compares algorithm count and move count for several popular Last Slot / Last Layer variants for methods that orient edges beforehand (Petrus, ZZ, Heise, ie good methods). Frequency-normalized...

Comparison of ZZ/Petrus LS/LL Methods]]>