reThinking the Cube
Member
- Joined
- Dec 11, 2009
- Messages
- 294
It just means that the programmer doesn't really understand what random-state refers to. It's also very very easy to generate a random position; I don't understand why you guys are using such convoluted methods. >_>
Hmm, is my randomCube() function a bit bloated?? I couldn't think of a more direct algorithm than that :confused:
Given that Jaap's solver just uses two numbers for the position, you should just be randomly generating those two numbers. I don't know what Dan did to modify the code for CCT, but this is how I generated a random position in the original scrambler:
int p = (int)(Math.random()*5040), o = (int)(Math.random()*729);
I am looking for a trustworthy source of info that shows the distribution for true random state positions (generated by this 2 random# method) according to the #of moves away from solved state. What % of positions generated this way will be 1,2,3,4,5.....11 moves away from solved at the completion of the scramble?