Timeline for How to represent a Rubik's Cube in a data structure
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 21, 2021 at 10:27 | comment | added | Harith | 9 years later, jumping in: If your goal is to generate random cube states for human solvers which will be used for serious events, it's generally accepted to generate a random state for the cube and check if it's valid, rather than performing n turns on the cube. The former is more random than the first, though I'm not sure exactly why. | |
| S May 11, 2012 at 4:20 | history | suggested | Fuhrmanator | CC BY-SA 3.0 |
grammar/spelling/punctuation
|
| May 11, 2012 at 4:20 | review | Suggested edits | |||
| S May 11, 2012 at 4:20 | |||||
| Apr 4, 2012 at 1:07 | comment | added | Ergwun | Classic "you don't want to start from here" advice! | |
| Apr 3, 2012 at 16:53 | history | edited | Matthew Vines | CC BY-SA 3.0 |
added 47 characters in body
|
| Apr 3, 2012 at 16:47 | history | answered | Matthew Vines | CC BY-SA 3.0 |