I have also put together a catalogue of my improved Megaminx pattern algorithms.
I used Walter Randelshofer’s Megaminx pattern collection as the starting point:
https://www.randelshofer.ch/rubik/megaminx/
So far, I have improved 218 out of 334 patterns, which is about 65.3% of the entire catalogue. Another 76 results tie the previously published algorithms, while 40 are currently longer.
Overall, the total length of the catalogue has been reduced from 10,250 BTM to 8,801 BTM, saving 1,449 moves in total.
Some of the more interesting results include:
- 4 Propellers: 58 → 25 BTM
- Superfliptwist: 76 → 44 BTM
- 4 Stars: 50 → 25 BTM
You can browse all of the results here:
https://ananasclassic.github.io/improved_megaminx_patterns/
This is the interactive catalogue. It contains all 334 patterns and lets you search and browse through them. Each pattern page shows the previously published algorithm, my personal-best solution, an FTM-focused solution, the move counts, and an interactive 3D Megaminx preview. There are also direct links for opening each algorithm in Alpha Twizzle.
The complete source code and dataset are available here:
https://github.com/AnanasClassic/improved_megaminx_patterns/tree/main
The GitHub repository contains the website source code and the full machine-readable pattern database, including the old and new algorithms, their lengths, pattern names and codes, author information, and Twizzle links. This may be useful to anyone who wants to analyse the results or reuse the data in another Megaminx project.
Ivan Litvak and I are also planning to rerun some of these searches with significantly wider beam widths. Our previous experiments suggest that increasing the available computational power can produce further improvements, so there is a good chance that at least some of the current results can still be shortened.
These results are not necessarily optimal; they are simply the shortest solutions I have found so far. I plan to keep working through the catalogue and trying to improve the remaining patterns. I am also interested to see whether anyone can shorten some of these solutions further.