Alg decorator

[Roman]

I am looking for a software that, when given a speedcubing algorithm, returns its mnemonic-friendly representation. That might include:

- surrounding known patterns in parentheses: F R U R' U' R U R' U' F' -> F (R U R' U') (R U R' U') F'
- coloring certain patterns: F R U' R' U' R U R' F' R U R' U' R' F R F'
- highlighting repeating patterns: M2 U M2 U2 M2 U M2 -> (M2 U M2) U2 (M2 U M2)

Does anything similar exist?

If not, do you think it is possible to come up with such automatic alg markup that would be able to convert e.g. a set of PLL algs to the way the're represented in cubeskills PDF?

 

[xyzzy]

Not exactly what you're asking for, but vaguely in a similar direction:

Decompose algorithms in commutator notation

Some algorithms in the Rubik's cube may not be too easy to decompose. For example, actually D F' R U' R' D' R D U R' F R D' R' can be decomposed as D:[F' R U' R',D' R D R'], R' U S' U' S R U' R S R' S' U can be decomposed as [R' U S',U' S R S']. Recently I made a tool to decompose algorithms in...

www.speedsolving.com

 

[MagicVince]

This is interesting. I did a cheat-sheet with PLL, times ago, and I also used some coloration on the following sequences:
- RUR'U' (sexy move)
- R'FRF' (sledge hammer)
- RUR'F'
- R'FR2U'
- R'F'R2U'
Do the last ones have a name? And do you use other sequences to memorize algs?

 

[Deleted member 36445]

I am looking for a software that, when given a speedcubing algorithm, returns its mnemonic-friendly representation. That might include:

- surrounding known patterns in parentheses: F R U R' U' R U R' U' F' -> F (R U R' U') (R U R' U') F'
- coloring certain patterns: F R U' R' U' R U R' F' R U R' U' R' F R F'
- highlighting repeating patterns: M2 U M2 U2 M2 U M2 -> (M2 U M2) U2 (M2 U M2)

Does anything similar exist?

If not, do you think it is possible to come up with such automatic alg markup that would be able to convert e.g. a set of PLL algs to the way the're represented in cubeskills PDF?

I never seen a script that does that.

but that's perfectly possible to make

you could have an array of common triggers and algs
for example:

["R U R' U'", "L' U' L U", "R U R' U R U2 R'", ...]

then you surround those algs with parenthesis by using normal string methods or regexp functions.

but a problem arise:

what are the best triggers in an alg?

if two triggers overlap, which one should be chosen?

maybe a "priority" attribute or even the position of the trigger/alg on the array should determine.

or the function could return a list with various possibilities and you choose which one you want.

badmephisto's site has good examples of this type of separation

Badmephisto's Cubing Site: OLL's

Badmephisto's cubing website

badmephisto.com

Badmephisto's Cubing Site: PLL's

Badmephisto's cubing website

badmephisto.com

for oll knowing sexy move, sledge hammer and sune and their variations makes you know more than 60 percent of oll by that list

 

[MagicVince]

Actually, I am thinking at a workaround.
I made a browser extension to highlight some words on a web page.
If you have a webpage like the ones above, you can just highlight your triggers by typing for instance:
R U R' U'
L' U' L U
R U R' U R U2 R'
in the input box of the extension, and they will automatically highlight in the webpage where you have all your algorithms.
It just answers your second bullet point (and only if the algs are on a webpage, with the correct format) but I gave it a try to show you how it comes out. Here is the result:

What do you think?