You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
In big cube scrambles, a sequence with unnecessarily many regrips might appear, such as "Rw Lw' R2 L", where all the moves are across the same axis, and therefore the order of them doesn't change the scramble state.
My proposal is that anytime moves on the same axis appear in sequence, they are sorted, such that you perform all moves starting with the same letter first, e.g. "L' Lw 3Lw2 3Rw Rw' R2" instead of switching back and forth between L and R.
i propose sorting moves left to right, top to bottom, and front to back, but i'm impartial to the directions.
The text was updated successfully, but these errors were encountered:
This is essentially what MERGE_REDUNDANT_MOVES_PRESERVE_STATE would achieve in AlgorithmBuilder. However, nobody ever got round to implementing this and I fear it won't be super trivial (or at least needs a whole lot of tests to do correctly) to implement.
I'll leave this open for the time being but please understand that this is not high on our priority list.
In big cube scrambles, a sequence with unnecessarily many regrips might appear, such as "Rw Lw' R2 L", where all the moves are across the same axis, and therefore the order of them doesn't change the scramble state.
My proposal is that anytime moves on the same axis appear in sequence, they are sorted, such that you perform all moves starting with the same letter first, e.g. "L' Lw 3Lw2 3Rw Rw' R2" instead of switching back and forth between L and R.
i propose sorting moves left to right, top to bottom, and front to back, but i'm impartial to the directions.
The text was updated successfully, but these errors were encountered: