The Rubik’s Cube

One of the presents I got for Christmas was the 3x3x3 Rubik’s Cube, possibly the most famous sequential movement puzzle ever, next to the 15 puzzle. It’s remarkably hard, and the best I can do (without a guide) is to either solve the top face of cubies, the 2*2*2 section of it, and any number of corner cubes. With the guide, I have only  managed to solve it a few times, certainly less than the number of times I’ve read a long scientific book.

There are any number of methods for solving the Rubik’s Cube, with some being able to solve any cube in at most 30 moves, (The minimum is thought to be 22) and one of the easiest to understand is Dedmore’s method, shown here. Computers are much better at solving the Cube, with some examples being Rob’s Rubix Repair, a service that solves Rubik’s cubes in near-minimum moves depending on how long you are willing to wait, A Rubik’s Cube-solving Lego Robot:

A program called ACube solving a 1000*1000*1000 Cube:

And MagicCube4D and 5D, programs for making and solving various 4-dimensional and 5-dimensional Rubik’s Cubes:

Of course, people aren’t too bad with solving various Rubik’s Cube’s, as shown by Guinness World Records (about 10 seconds for the 3*3*3), and the cubes that are available. Companies have made up to 11*11*11 cubes, and there are videos ,such as the one following, of people solving a 20*20*20 cube.

People have even solved the 4-dimensional and 5-dimensional cubes, as shown by the MagicCube5D Hall of Insanity, where even my computer lags on solving some of them.

I, of course, still can’t solve the 3x3x3.

  1. January 30th, 2010

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: