This discussion board is a place to discuss our Daily Challenges and the math and science
related to those challenges. Explanations are more than just a solution — they should
explain the steps and thinking strategies that you used to obtain the solution. Comments
should further the discussion of math and science.
When posting on Brilliant:
Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.
Markdown
Appears as
*italics* or _italics_
italics
**bold** or __bold__
bold
- bulleted - list
bulleted
list
1. numbered 2. list
numbered
list
Note: you must add a full line of space before and after lists for them to show up correctly
All algorithms when repeated enough times on a solved cube result in a completely solved cube. You can do any specific set of moves repeatedly without moving the cube and it'll get back together eventually.
@Muhtasim Dibbo
–
That's actually not how that works. Significant group theoretic work went into understanding the Hamiltonian circuit of the Rubik's cube: http://bruce.cubing.net/ham333/rubikhamiltonexplanation.html
@Dimitri Leggas
–
Bruce's work is impressive (I have worked with Bruce on other Rubik's Cube related mathematics), but not relevant to Muhtasim's comment. Rubik's Cube can be represented by a permutation group of finite order. From Lagrange's theorem, all elements (any sequence of face turns) starting from the identity (the solved cube) have an order (how many times the sequence is repeated before returning to the identity, or solved state) that must divide the order of the group. Since the group representing Rubik's Cube is finite, the order all its elements must therefore be finite. So, any sequence of moves applied to a solved cube will return to the solved state after a finite number of repetitions.
@Calvin Lin
–
R- rotate the right face clockwise, U- rotate the top face clockwise, R'- rotate the right face anti-clockwise And F- rotate the front face clockwise
@Calvin Lin
–
THESE R THE TYPES OF MOVE-
R - MEANS TO MOVE RIGHT HAND SIDE OF CUBE VERTICALLY UPWARDS.
U - MEANS TO MOVE THE UPPER SIDE OF CUBE TO THE LEFT SIDE.
R' - MEANS TO MOVE RIGHT HAND SIDE OF CUBE VERTICALLY DOWNWARDS.
F - MEANS TO MOVE THE FRONT SIDE OF THE CUBE TO THE RIGHT SIDE.
The order of a sequence of moves is a matter of determining the effect on the sub-cubes as a permutation using disjoint cycle notation, then the order is the LCM of the cycle lengths. For RUR′F the effect on the sub-cubes is a a 2-cycle on edge FR; a 5-cycle on edges UF, UL, UB, FL, and FD; and a 5-cycle on the 4 corners of the F face (FUL, FUR, and FDL), and FDR. The LCM of 2, 5, and 5 is 10. Of note would be the maximal order which is 1260 of which DF′DR′U2 is an example with shortest possible length in HTM (Half-Turn Metric, where turns of 90∘,180∘, and 270∘ are considered a single move).
Those who know non commutative algebra can easily figure it out that each generator (RUR'F) forms a normal subgroup of order (here 10).
find n such that (RUR'F)^n=identity (means doing nothing on the cube)
Eg: (RUR'F)^2=RUR'FRUR'F, among these some comnbinations can be replaced by other moves.
Finally one can show (clever manipulations), (RUR'F)^10=Identity
Always Keep your total cube orientation in a fixed position during the moves.
R- Right side face clockwise rotation
U- upside face clockwise rotation
R'- Right side face anti-clockwise rotation
F-Front face clockwise rotation
@Arindam Karmakar
–
They are codes to tell you how to move the Rubik's cube.
F is for Front.
R: Right. L: Left. U: Under.
F means turn the front side 90 degrees clockwise.
F' means turn the front side 90 degrees anticlockwise.
Am I right in thinking that the number of moves given in any algorithm with as many moves as possible but repeated over a number of times, the number of times cannot be a prime number?
R means rotating the right face clockwise.. R' means to do the same in anticlock direction... U, F, D, B, L mean up, front, down, back, and lesft respectively...
you could just take a cube and keep doing U R repeatedly and get the original configuration back.....but u need to have the patience as you have to do it quite many times..
Doing the same move multiple times creates a subgroup of all moves, so by lagrange's theorem, the number of time you must repeat the move divides the number of possible combinations of the rubik's cube.
Technically, this will happen no matter what sequence of moves one makes. It may take longer or shorter than 10 iterations, but because there are a finite number of positions for the cube, it has to eventually return to its original state.
What would be the biggest number of steps required to get a cube back in solved state for a 4-lettered algorithm...and what would be the algorithm.....i found that R'U is a big one
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
Please explain it more!!!!!!
Log in to reply
DTYW CI6
there is nothing to explain just solve the rubik's cube and apply the given algorithm (it won't help you to solve the cube its just a magic move)
Log in to reply
All algorithms when repeated enough times on a solved cube result in a completely solved cube. You can do any specific set of moves repeatedly without moving the cube and it'll get back together eventually.
Log in to reply
Log in to reply
Can you explain what R U R' F mean?
Log in to reply
ok
These moves are trivial. Any algorithm operated repeatedly on a cube will result back in the Original configuration in finite repeatitions.
Log in to reply
I can agree
Log in to reply
It can be proven mathematically
Log in to reply
The order of a sequence of moves is a matter of determining the effect on the sub-cubes as a permutation using disjoint cycle notation, then the order is the LCM of the cycle lengths. For RUR′F the effect on the sub-cubes is a a 2-cycle on edge FR; a 5-cycle on edges UF, UL, UB, FL, and FD; and a 5-cycle on the 4 corners of the F face (FUL, FUR, and FDL), and FDR. The LCM of 2, 5, and 5 is 10. Of note would be the maximal order which is 1260 of which DF′DR′U2 is an example with shortest possible length in HTM (Half-Turn Metric, where turns of 90∘,180∘, and 270∘ are considered a single move).
Those who know non commutative algebra can easily figure it out that each generator (RUR'F) forms a normal subgroup of order (here 10).
find n such that (RUR'F)^n=identity (means doing nothing on the cube) Eg: (RUR'F)^2=RUR'FRUR'F, among these some comnbinations can be replaced by other moves. Finally one can show (clever manipulations), (RUR'F)^10=Identity
Always Keep your total cube orientation in a fixed position during the moves. R- Right side face clockwise rotation U- upside face clockwise rotation R'- Right side face anti-clockwise rotation F-Front face clockwise rotation
There exist much more moves like this:
L'ULU do this 5 times
U'R 62 times
UL'U'L 6 times
RU'L'U 27 times
M'U 8 times
M'UM'U' 6 times
R2L2 12 times
and many more ........................................
Happy Cubing!!!!!!!
Log in to reply
R 4 times
Log in to reply
Yes. That's the easiest "IDENTITY ALGORITHM "
R U' x63
Log in to reply
Actually what are these 'R' 'U' 'F' ??
Log in to reply
I too don't know.
Log in to reply
another move is F R U R'U'F'
RU R'U'
Am I right in thinking that the number of moves given in any algorithm with as many moves as possible but repeated over a number of times, the number of times cannot be a prime number?
it's awesome !!
what does RU R`F mean please???
Log in to reply
R means rotating the right face clockwise.. R' means to do the same in anticlock direction... U, F, D, B, L mean up, front, down, back, and lesft respectively...
cool. i liked it
Is there a way to predict how many times you have to do the move to get back to solve?
Log in to reply
You have to program it. Look at this
You all can even try R' D' R D. I think it works with almost all of the algos. The number of times you have to do it may differ.
Log in to reply
you could just take a cube and keep doing U R repeatedly and get the original configuration back.....but u need to have the patience as you have to do it quite many times..
how to get fully solved cube?
Log in to reply
are you saying to solve the cube or about the above mentioned stuff
VERRY VERRY EASY
@Rishabh Jain Try this, R'D'RD 6 times.. Same thing happens!
Do any random move repeatedly and it will get solved eventually not for this move only
I just did it and it does get solved
not just only RUR'F , it works for almost all algorithms provided they are 4 moves
Let me give you one more Take a solved rubiks cube and do the following 6 times FRUR'U'F'
hey are u in fiitjee south delhi??? @Rishabh Jain
Log in to reply
no i am a commerce student from east delhi (totally opposite answer what you asked?)
Doing the same move multiple times creates a subgroup of all moves, so by lagrange's theorem, the number of time you must repeat the move divides the number of possible combinations of the rubik's cube.
normal position
R= right side clock wise U= upper side clock wise R'=right side anti-clock wise F= front side clock wise
But i didn't get it !!!
it remains same
Can you explain what is RU R' F
any particular move can do it not only this move :P
Awesome
6 repetitions and the cube will resolve itself.
what does that mean
Technically, this will happen no matter what sequence of moves one makes. It may take longer or shorter than 10 iterations, but because there are a finite number of positions for the cube, it has to eventually return to its original state.
You could also repeat RUR'U' 6 times to achieve the same result.
What would be the biggest number of steps required to get a cube back in solved state for a 4-lettered algorithm...and what would be the algorithm.....i found that R'U is a big one
Log in to reply
You will have to do it 62 times...
Log in to reply
I think 63 is the number.....RU has to be done 105..
I found out that there are many such moves such as moving a solved cube 16 times with R U R' F B.
R x4 , R'x4 ,....
Log in to reply
TEACH ME!!!!!!!!!!
Log in to reply
It is a bunch at internets
Log in to reply
Which method do you use?
IF you use the CFOP method please tell me from where did you learn it?
I want to learn the same.Suggest me a better site for this.
Thank you :)
Log in to reply
Log in to reply
Log in to reply
Log in to reply
Log in to reply
Log in to reply
Log in to reply
Log in to reply