Search results

What makes you think I am?

This can be solved with only simple jumbling. The only requirement for a state to be solvable with only non-jumbling moves that is not currently satisfied is that the parity of the center permutation in each orbit should mach the parity of the number of flipped edges along that orbit. This can...

Just got 6 center skips in 7 consecutive Master pyraminx solves. Each happens with 1/12 probability, so one should expect to see 6 or more out of 7 consecutive solves 78 times out of 12^7 solves, or roughly once every 459382 solves. Not quite as extraordinary as my accidental XXcross on...

I have made updates to make the scrambler faster and the interface more convenient. The .py files with "new" at the end represent these updated versions. Most importantly, the full scrambler now runs much faster (6 seconds down from 20 on my machine) and the interface will make it such that more...

I have added a non-jumbling scrambler for those who wish to practice curvy copter untainted by imperfect shapes. It is otherwise the same.

The first block of code after line 179 generates a random position. If you want to fix the position, just put something below that block defining "start" to be whatever position you want. Of course it would be faster if you just ran the following code instead: def encode4(pos): code=0...

You guys are kidding right? No one averages less than 24 or 17 on those puzzles respectively; saying the best people take [UWR single time] isn't very fair. Both puzzles are sufficiently complicated and have enough pieces that averages would never be based primarily on luck.

The scrambles are numbered 0-11 because I was too lazy to add a +1 in the code. To use that file, either write some code to use the file or feed the position you want solved into the solver. Both of these will require you to be able to edit the code.

The face-turning equivalent of a edge-turning cube is a rhombic dodecahedron.

Already did.

Yes. All the ones that I haven't yet mentioned are already move optimal.

Here are shorter algs than written for some of the Orientation cases: T: F R B L B R B L B F H: L F L F R F R B L R F L R B (there are lots of ways to do this in 14 moves) Pi: R B R B F L B R B L R F

One of the helper files for my solver has optimal solutions for each of the 419904 cases for after F2L is solved. These are just two of them. The file was made with a simple BFS from the solved position. P.S. I cannot guarantee that they are actually move optimal, just that they are move...

Keeping your lines under 80 characters might make people less annoyed by your code and more likely to read it. So would putting spaces between things (like c = a + b). However, these don't affect how the code runs, and thus my code still functions despite being oftentimes unreadable.

Everything needed for you to run the scrambler is here. Just download everything in the folder and run the python code while the reference files are in the same folder as the .py file. Currently the scrambles are outputted just with python print statements; if you would prefer them outputted in...

Well generally you can do things like (UR+ LF+ UF UR- LF-) to swap two pairs of centers, one within a single orbit and one pair of centers from different orbits. It is not so hard to use moves like this to get centers in appropriate orbits.

For me (I average just under 13), 2 or 3 out of 100 solves are sub 10 on average.

You can't swap only those 2 centers (easily) because the center permutation is even barring significant jumbling. You have to do a 3-cycle of centers, for example the misplaced red once and two blue ones.

Of course, but that wouldn't make it a random-state scrambler anymore. If you want shorter random-state scrambles, you need a more sophisticated solver. To do that would require more compute power than most people currently have (we could do slightly better with better coding, but I believe the...

Here are 12 random-state scrambles using Sion's preferred notation: This results in a wider range of scramble lengths (and longer scrambles on average, but only because we have stopped using shorthand). For example, the last 2 scrambles here are 83 and 127 moves.