obelisk477
Member
Cube explorer can do alot. Give me an example of a case you're trying to solve, and I'll show you how to do it on Cube Explorer
Hi all,
I am currently using Cube Explorer 5.12 to generate 3x3 algorithms, but I need a more advanced program that is capable of generating generalized orientation algorithms. The constraints are much more complicated than 'direct solve'. In the case of orient-only, pieces are free to move around as long as their orientation is solved. Is such a program readily available?
Eric Fattah
BC, Canada
I don't have a mac, but I use cube explorer through wine on linux, and it works great. I know you can get wine for mac, so maybe you could try that.Is there a way that i can get cube explorer to work on my mac? Or is there another programm as a alternative?
It works Thank youI don't have a mac, but I use cube explorer through wine on linux, and it works great. I know you can get wine for mac, so maybe you could try that.
Square-1 is random state, and so is 4x4. Check the readme for Tnoodle for details. 5x5x5 and up just apply (N-2)*20 random moves with some smart filtering to avoid trivial move sequences. Megaminx is also random moves with U turns added to rotate the puzzle at regular intervals. Interestingly, an essentially negligible fraction of possible states can be reached with the megaminx scrambles, but since there's no bias in those states, it doesn't matter much.Not sure if it's puzzle theory or software, but - how are scrambles generated?
I looked at the code at Mark 2, and it seems that 2x2, 3x3 and Pyra are random state (which seems reasonable since optimally solving them is not that hard). For NxNxN, I think it just randomly generates moves - is that true? I couldn't figure out how do the SQ1 and Megaminx scramblers work (I'm assuming they're not random state since solving them would be hard, are they just random moves?)
From the regulations:Not sure if it's puzzle theory or software, but - how are scrambles generated?
I looked at the code at Mark 2, and it seems that 2x2, 3x3 and Pyra are random state (which seems reasonable since optimally solving them is not that hard). For NxNxN, I think it just randomly generates moves - is that true? I couldn't figure out how do the SQ1 and Megaminx scramblers work (I'm assuming they're not random state since solving them would be hard, are they just random moves?)
4b3) Specification for the scramble program: An official scramble sequence must produce a random state from those that require at least 2 moves to solve (equal probability for each state). The following additions/exceptions apply:
- 4b3a) For blindfolded events, the scramble sequence must orient the puzzle randomly (equal probability for each orientation).
- 4b3b) 2x2x2 Cube: The (random) state must require at least 4 moves to solve.
- 4b3c) Skewb: The (random) state must require at least 7 moves to solve.
- 4b3d) Square-1: The (random) state must require at least 11 moves to solve.
- 4b3e) 5x5x5 Cube, 6x6x6 Cube, 7x7x7 Cube, and Megaminx: sufficiently many random moves (instead of random state), at least 2 moves to solve.
- 4b3f) Pyraminx: The (random) state must require at least 6 moves to solve.
For 3x3? There isn't one. Random state doesn't use a certain number of moves, it generates a random position the cube could be in and tells you a near-optimal way to get to it.On QQtimer what is the default scramble length? I may have changed this, and I'm just curious.