3^4 Fewest Moves (computer assisted) in 122 STM by Andrew Farkas + Luna Harran - Hypercubing Leaderboards

Hypercubing Leaderboards


3^4 Fewest Moves (computer assisted) in 122 STM by Andrew Farkas + Luna Harran

Solver Andrew Farkas + Luna Harran
Puzzle 3^4 (no filters, no macros, computer-assisted)
Time -
Move count 122
Solve date 2025-09-23
Upload date 2025-10-22
Program Hyperspeedcube 1
Log file 2025-09-24_computer_assisted_fmc_wr_122stm_andrew_farkas_and_luna_harran.hsc
Solver notes

This solve used robodoan, a new computer search program by Andrew Farkas for computer-assisted 3^4 FMC.

We completed this solve in 4 stages:

  • F2L (63 STM, automatic) - We generated 5 scrambles using MC4D, loaded them into robodoan (a new search program for computer-assisted 3^4 FMC) and manually reviewed several of the generated solutions. The shortest F2L solution was 61 STM, but it had a poor OLC. We found one that was 63 STM and had a decent OLC (orient last cell).
  • OLC (21 STM, manual) - We solved OLC using 2 algorithm executions, including a slice RKT-canceled fat sune and a 6-move 4D OLC algorithm.
  • 2cPLC (8 STM, manual) - We solved 2cPLC (permute last cell) using an adjacent 3-cycle that canceled into the last OLC algorithm.
  • PLC (30 STM, computer-assisted) - We entered the final cube state into Cube Explorer to get a 3D solution and then manually found a decent RKT-cancel for it.

History

The most recent changes are listed at the top.

Timestamp Editor Description
2025-12-14 at 01:24:22 Migration

Migrated from old schema
FMC solve previously accepted by Rowan Fortier