qqwref
Legend
- Joined
- Dec 18, 2007
- Messages
- 7,834
- Location
- a <script> tag near you
- WCA ID
- 2006GOTT01
- YouTube
- Visit Channel
http://mzrg.com/miniSites/scramblers/222 11moves.html
I'd like to propose for this to become WCA-official but this type of thing isn't under consideration right now so there is no point in posting it in the WCA forum yet. Anyway this is a modification of the current WCA-official scrambler. Here are the changes:
- The official scrambler does 500 moves to find the random position, but this one is better because it simply picks a random position directly.
- This scrambler will discard scrambles that are 7 or fewer moves from solved (this happens <20% of the time). This means that with this scrambler there are no incredibly easy solves! I think this could restore some legitimacy to the 2x2 single solve event.
- The scrambles here are always 11 moves (the maximum number of moves a 2x2 scramble could require) so there is no way to tell how easy a scramble is by looking at the moves.
- I removed the "minimum scramble length" thing because that was not necessary.
- I cleaned up the code a LOT, removing any unused functions and rewriting some things to make them smaller without changing what they did. (For comparison's sake, this is 10kb and the official one is 16kb.)
I'd like to propose for this to become WCA-official but this type of thing isn't under consideration right now so there is no point in posting it in the WCA forum yet. Anyway this is a modification of the current WCA-official scrambler. Here are the changes:
- The official scrambler does 500 moves to find the random position, but this one is better because it simply picks a random position directly.
- This scrambler will discard scrambles that are 7 or fewer moves from solved (this happens <20% of the time). This means that with this scrambler there are no incredibly easy solves! I think this could restore some legitimacy to the 2x2 single solve event.
- The scrambles here are always 11 moves (the maximum number of moves a 2x2 scramble could require) so there is no way to tell how easy a scramble is by looking at the moves.
- I removed the "minimum scramble length" thing because that was not necessary.
- I cleaned up the code a LOT, removing any unused functions and rewriting some things to make them smaller without changing what they did. (For comparison's sake, this is 10kb and the official one is 16kb.)
Last edited: