Observed arrival · 2026-11-08
A Near-Optimal Solver for Enormous Rubik’s Cubes
A research project presents algorithms and an implementation for solving very large n × n × n Rubik’s Cubes with a provable move bound.
○Open
⊠Login
$Paid
†Ads
✦Pretty
●Pro
◎Niche
◉Human
⚑Risk
ƒJS
- For
- Rubik’s Cube researchers and algorithm enthusiasts
- Worth noticing
- The page says its implementation outperforms existing solvers for cubes as small as n = 840.
Field notes
The abstract gives a move bound of 30.5 n²/lg n + o(n²/lg n), and says the earlier algorithm’s implicit constant was 2.01 × 10⁴⁰. The implementation is described as linear-time in the input size, with O(√N lg N) extra space. The page also includes cube diagrams and links to code, data, a demo, and a solve video.
Observed signals
Read the marks
Editorial observations of this landing page, not a rating.
○OpenPublic substance visible
✦PrettyNotable craft visible
●ProPolished or operationally mature
◎NicheUnusually specific use
One card from the complete issue