Rubik's Cube Each method of solving the Rubik's Cube employs its own set of algorithms, together with descriptions of what effect the algorithm has, and when it can be used to bring the cube closer to being solved. Many algorithms are designed to transform only a small part of the cube without interfering with other parts that have already been solved so that they can be applied repeatedly to different parts of the cube until the whole is solved. For example, there are well-known algorithms for cycling three corners without changing the rest of the puzzle or flipping the orientation of a
Doubling the cube at solving what they saw as an obstinate but soluble problem. However, the nonexistence of a solution was finally proven by Pierre Wantzel in 1837. In algebraic terms, doubling a unit cube requires the construction of a line segment of length , where ; in other words, . This is because a cube of side length 1 has a volume of , and a cube of twice that volume (a volume of 2) has a side length of the cube root of 2. The impossibility of doubling the cube is therefore equivalent to the statement that is not a constructible