This action might not be possible to undo. Are you sure you want to continue?

)

48 authors | 179 revisions | Last updated: September 27, 2012 14

and finally the last layer. then the middle layer. The method described in this article is the layer method: we first solve one face of the cube (first layer).com/apps/outlook-sync .Article EditDiscuss The Rubik's Cube can be very frustrating and may seem next to impossible to restore to its original configuration. it is very easy to solve. Steps First Layer 1. However. once you know a few algorithms. 1 Familiarize yourself with the Notations at the bottom of the page. google. Ads by Google Sync Your Calendar Get started quickly with Google Apps Sync for Microsoft Outlook.

2 Choose one face to start with. Set into position the four edge pieces that contain white.2. . Turn the cube over 180° so that the cross now on the bottom. In the examples that will follow.) All four edge pieces can be placed in a maximum of eight moves (five or six in general). o Place the cross at the bottom. the color for the first layer is white. (You should be able to do this by yourself without needing algorithms. 3. 3 Solve the cross. Solve the cross.

here is an example of one corner being solved: o At the end of this step. white) at the bottom. To get you started. 4 Solve the four corners of the first layer. 5. You should also be able to place the corners without needing algorithms. with a solid color (in this case. You should now have the first layer complete and look like this (from the bottom side): Middle Layer . the first layer should be complete. one by one.4. 5 Verify your first layer is correct.

2 Verify correct positioning. 2.1. o If the edge piece is located in the last layer : (1. Your edge piece will then be in the last layer.a) (1. You need to know only one algorithm to solve the middle layer.b) symmetrical to (1. The second algorithm is symmetrical to the first. Your cube should now have the first two layers complete and look like this (from the bottom side) : . and you just have to use the algorithm again to position it properly in the middle layer. Those edge pieces are the ones that do not contain yellow in our example. 1 Place the four edges of the middle layer. simply use the same algorithm to place any other edge piece in its position.a) o If the edge piece is in the middle layer but in the wrong place or with the wrong orientation.

Last layer 1. and the left side is blue. Therefore the front corner on the right must contain green. facing you. Turn the top layer until these two corners are on the correct color side. Swap the two front corners if needed. Note that on the other side. our goal is to place the corners of the last layer in their correct position. if you notice that both the front pair and the back pair of corners need to be swapped. At this step. 1 Permute the corners. Turn the cube around to place the other side (orange) in front of you. turn the top layer until those two corners are on the red side of the cube. For instance.a) o o Do the same with the two corners at the back. and swap them if needed. regardless of their orientation. As an alternative. the right side is green. if the two adjacent corners both contain red. o Determine whether the two corners of the front side are in their correct position. you can do it with only one algorithm (note the huge similarity with the previous algorithm): . and the front corner on the left must contain blue. the two corners of the top layer will both contain the color of that side as well (orange in our example). you will need to swap those two corners with the following algorithm: Swap 1 and 2 : (2. If it is not the case. In our example. o o Locate two adjacent corners that share a color other than the color of the top layer (other than yellow in our case).

and in which direction (clockwise).Swap 1 with 2 and 3 with 4 : (2.b) Symmetrical to (3. The blue arrows show which three corners you are turning. you will need to perform the algorithm more than once : Two correctly oriented corners : . 2 Orient the corners. In some cases. You need to know only one algorithm to orient the corners: (3. Locate each top color facelet of the corners (yellow in our case). If the yellow stickers are the way shown on the pictures and you perform the algorithm once. you should end up with the four yellow stickers on top : o It is also convenient to use the symmetrical algorithm (here the red arrows are counter-clockwise turns): (3.a) o The algorithm will rotate three corners on themselves at once (from the side to the top).b) 2.a) o o Note: performing one of these algorithms twice is equivalent to performing the other.

apply (3.= = + = = + = = + o No correctly oriented corner : = = + = = + o More generally.a) in those cases: rners : er : .

a) o o Note : performing twice one of these algorithms is equivalent to performing the other. You will need to know only one algorithm for this step.3. 3 Permute the edges. You will then have only one edge correctly positioned. If all four edges are incorrectly positioned. o If all the edges are in their correct positions. perform one of the two algorithms once from any side. 4. 4 .b) Symmetrical to (4.a) o o Or its symmetrical : (4. If one edge only is correctly positioned. you are done for this step. Check whether one or several edges are already in the correct position (the orientation does not matter at this point). use the following algorithm : (4.

You will need to know two algorithms for that last step : Dedmore "H" Pattern (5) Dedmore "Fish" Pattern (6) o Note the DOWN. UP. and you will have to perform that algorithm one more time to solve the cube. RIGHT. This is the key to the notations used. 5. perform the "H" pattern algorithm from any side. LEFT. 1 .Orient the edges. 5 Congratulations! Your cube should now be solved. sequence to most of the Dedmore "H" and "Fish" algorithms. Notations 1. You really have only one algorithm to remember since : (6) = + (5) + o If all four edges are flipped.

the front (red) and top (yellow). showing three sides of the Cube: the front (red). Orange and Yellow faces are in clockwise order). White opposes yellow. and the right side (green). between each pair of adjacent corners.o o o The pieces that compose the Rubik's Cube are called Cubies. There are six of them. Blue opposes green. 2. o The Top View. and the color stickers on the Cubies are called facelets. at the center of each face of the Cube. each have one facelet The corners (or corner pieces). In Step 4. at the corners of the Cube. There are three types of Cubies: The centers (or center pieces). There are eight of them. Orange opposes red. showing only the top of the cube (yellow). The the colors used for these illustrations is called BOY (because the Blue. and each have three facelets The edges (or edge pieces).b) is illustrated with a picture showing the left side of the cube (blue). The front side is at the bottom (red). . the top (yellow). the algorithm (1. There are 12 of them and each have 2 facelets Not all cubes have the same color schemes. 2 This article uses two different views for the Cube: o The 3D View.

4 When a facelet is grey. . while the yellow facelets of the top front corners are both located on the front side of the cube. 4. In the picture. 3 For the top view. the yellow facelets of the top back corners are on the top (yellow) side. it means that its color is not important at the moment.3. each bar indicates the location of the important facelet.

the edges on the left and right are both incorrectly oriented. 6 For the top view.a)). In the picture. the yellow facelets for those two edges are not on the top. 6. symmetrical to (3. In the case of the algorithm (3. o o o The axis of the rotation is the big diagonal of the cube (from one corner to the corner all the way on the other side of the cube). Red arrows are used for counter-clockwise turns (algorithm (3. at the end of the algorithm they will be on top. This means that if the top face is yellow. it will rotate the three corners on themselves as shown. Blue arrows are used for clockwise turns (algorithm (3. the light blue facelets indicate that an edge is incorrectly oriented.5. 5 The arrows (blue or red) show what the algorithm will do. but on the side.b).a)). If the yellow facelets are as drawn on the picture.a) for instance. .

Rotation of the front side. datastorage. Rotation of one of the three vertical rows: Rotation of one of the three horizontal rows: A few examples of moves: START o o o Ads by Google Cheat Engine Download Cheat Engine -New & Latest Version. o 7 For the move notations it is important to always look at the cube from the frontside.cdw. Download Cheat Engine for Free! www.voltdb.7.com/Cheat-Engine Speedy Big Data Solutions Transactions processed at lightning speed.com/reclaim .LaunchNexus. Download the free edition! www.com Free Exclusive Resource Want to Reclaim 75% of Your IT Storage Space? CDW Knows How.

- Clock Planning Guideline v1.1
- Assesment RTN
- Juniper.visualexams.jn0 101.v2014!06!02.by.georgia.100q
- Route Sep 2015
- Mobile
- CV Daisy Bathla Planning Engineer
- Rubiks Cube 3x3 Solution-En
- Rubic Cube Solving
- How to Solve a Rubik
- Curso Cambridge de Ingles - English Learning - Essential Grammar
- Latest CCNA 640-802 Pass4sure Sample
- BSCI Study Notes
- BSCI Study Notes
- EIGRP
- CCNA Access List Sim 2
- CCNA Access List Sim
- BGP
- Huawei Router Software
- Sub Netting
- Comparison DataSheet of Routing Protocols RIP EIGRP OSPF
- EIGRP
- BGP
- IP Subnetting Cheatsheet
- 640_802 ccna syla

How to Solve a Rubik

How to Solve a Rubik

- [Springer-Verlag Berlin Heidelberg 2010] Learning Automata Teams
- metslib-tr
- 00761110
- l0 norm constraint LMS algorithm for sparse system identification
- djikstra
- Beginner Rubik's Cube
- An Iterated Greedy Algorithm for the Flowshop Problem
- Atc14 Paper Ongaro
- P06-1101
- DIP Project Report
- n1
- ADA BOOST ALGORITHM
- Astar
- c Programming Type Statement Expression
- MCS-031 Solved Assignment 2015-16
- A New Voice Activity Detection Algorithm Based on SOM & LVQ
- MD5
- Pseudo Code a LATEX Style File for Displaying
- Mark Allen Weiss - Data Structures and Algorithms in C++ (2)
- dsa.pdf
- Syllabus of AP (v3.0)
- 3010 Robotic Grasping of Novel Objects
- TravellingSalesmanProblem.pdf
- Www.dattalo.com Technical Software Pic Crc16
- Near-optimal Sensor Placements in Gaussian Processes
- UT Dallas Syllabus for se3345.081.06u taught by Ovidiu Daescu (daescu)
- Black-Holes-Algorithm-With-Fuzzy-Hawking-Radiation.pdf
- Brent Optimization
- Cav01go.ps
- Douglass 05

Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

We've moved you to where you read on your other device.

Get the full title to continue

Get the full title to continue reading from where you left off, or restart the preview.

scribd