D. Singmaster, Notes on Rubik's "Magic Cube", Enslow Publishers, 1981. The book that named the canonical move notation U, D, L, R, F, B and laid out the first algebraic study of the cube.
D. Singmaster (ed.), Cubic Circular, issues 1–8, 1981–1985. The first international puzzle newsletter; scans hosted at jaapsch.net/puzzles/cubic{1..8}.htm. Issue 3/4 in particular contains the pretty-pattern catalog that seeded §13.
J. Scherphuis, Jaap's Puzzle Page. jaapsch.net/puzzles/. Source for §27 (lights.htm/lomath.htm), §28 (pegsolit.htm), §29 (hamilton.htm), §30 (pgl25.htm), §31 (graphpuzz.htm) and the Cayley-graph catalogue in §14.
J. Slocum, J. Botermans, Circle Puzzler's Manual, 1986. Reference for rotational sliding puzzles (Hungarian Rings family) — generalises §31's two-face classification to multi-region overlap.
M. Anderson, T. Feil, Turning Lights Out with Linear Algebra, Mathematics Magazine 71(4):300–303, 1998. The reference proof that 5×5 Lights Out has dimkerA=2 (§27).
J. H. Conway, E. R. Berlekamp, R. K. Guy, Winning Ways for your Mathematical Plays, Vol. 4, A K Peters, 2nd ed., 2004. Chapter on peg solitaire formalises the 3-colouring (§28) and pagoda functions.
L. Lovász, Problem 11, in Combinatorial structures and their applications, Gordon and Breach, 1970. The original statement of the Hamiltonian-path conjecture (§29).
R. M. Wilson, Graph Puzzles, Homotopy, and the Alternating Group, J. Combinatorial Theory B 16:86–96, 1974. Sliding-puzzle counterpart of §31; combined with Jaap's result gives a clean dichotomy.
"Cmetrick Too" Contest, 2001–2003. An early online Rubik's-cube speed-solving contest with full result archive at jaapsch.net/puzzles/cmetrick.htm — historical seed of WCA-style standardized competition.
Puzzle Patents, indexed at jaapsch.net/puzzles/patents.htm. The intellectual-property timeline complementing this page's algebraic timeline (Rubik 1975, Nichols 1972, Ishigi 1976, …).
M. Thistlethwaite, The 45 move algorithm, unpublished, 1981. Reproduced in Jaap's puzzle page: jaapsch.net/puzzles/thistle.htm
T. Rokicki, H. Kociemba, M. Davidson, J. Dethridge, The diameter of the Rubik's cube group is twenty, SIAM J. Discrete Math. 27(2):1082–1105, 2013. tomas.rokicki.com/rubik20.pdf · cube20.org
H. Kociemba, The two-phase algorithm, technical notes, 1992–present. kociemba.org
D. Joyner, Adventures in Group Theory: Rubik's Cube, Merlin's Machine, and Other Mathematical Toys, 2nd ed., Johns Hopkins University Press, 2008. The definitive textbook on cube algebra.
C. Bandelow, Inside Rubik's Cube and Beyond, Birkhäuser, 1982. The earliest dedicated mathematical treatment.
The Rubik's Cube and Minimal Representations of Split Group Extensions, arXiv:2508.00687, 2025. arxiv.org/pdf/2508.00687
J. Mulholland, Math 302: Rubik's Cube — Cubology, Simon Fraser University course notes. sfu.ca/~jtmulhol/math302
E. Demaine, M. Demaine, S. Eisenstat, A. Lubiw, A. Winslow, Algorithms for Solving Rubik's Cubes, Algorithmica 80(8): 2229–2295, 2018. (Proves n×n×n Rubik's cube optimal solving is NP-complete and gives Θ(n²/log n) bounds.)
R. Stein et al., A Demigod's Number for the Rubik's Cube, arXiv:2501.00144, 2025. arxiv.org/pdf/2501.00144
T. Rokicki, Twenty-Five Moves Suffice for Rubik's Cube, technical report, 2008. Precursor to the 20-move final proof.
A. Frey, D. Singmaster, Handbook of Cubik Math, Enslow Publishers, 1982. Companion to Singmaster's notes, with worked exercises.
R. Korf, Finding optimal solutions to Rubik's Cube using pattern databases, AAAI 1997. The original IDA* approach.
P. Diaconis & M. Shahshahani, Generating a random permutation with random transpositions, Z. Wahrscheinlichkeitstheorie verw. Geb. 57:159–179, 1981. The seminal paper introducing Fourier analysis on finite groups for random-walk mixing-time bounds.
D. Bayer & P. Diaconis, Trailing the dovetail shuffle to its lair, Ann. Appl. Probab. 2(2):294–313, 1992. The "seven shuffles suffice" theorem; framework directly applicable to random walks on the cube group.
C. C. Sims, Computational methods in the study of permutation groups, in Computational Problems in Abstract Algebra, Pergamon, 1970. The original Schreier–Sims algorithm; foundation of BSGS-based CAS work.
A. Björner & F. Brenti, Combinatorics of Coxeter Groups, Springer GTM 231, 2005. Modern reference for random-walk and length-function theory on groups generated by reflections — applicable framework for cube QTM analysis.
É. Galois, Mémoire sur les conditions de résolubilité des équations par radicaux, 1830 (posthumous). The original proof of A_n simplicity for n ≥ 5 and its application to the unsolvability of the quintic.
The GAP Group, GAP — Groups, Algorithms, and Programming, version 4.x. gap-system.org — open-source CAS used to verify |G|, structure descriptions, and conjugacy classes.
T. Rokicki, H. Kociemba, M. Davidson, J. Dethridge, God's Number is 26 in the Quarter-Turn Metric, 2014. cube20.org/qtm
M. Reid, Superflip requires 20 face turns, online note, 1995. The first proof that the superflip pattern has Cayley-distance exactly 20.
J.-L. Lagrange, Réflexions sur la résolution algébrique des équations, 1771. Source of the original divisibility theorem (though stated in pre-group language; modern statement crystallized later by Cauchy, Cayley).
G. Frobenius, Über Gruppencharaktere, Sitzungsber. Berlin Akad. 985–1021, 1896. The founding paper of group representation theory (characters).
J.-P. Serre, Linear Representations of Finite Groups, Springer GTM 42, 1977. The canonical undergraduate-to-graduate text on character theory and Maschke's theorem — direct background for §26.
I. M. Isaacs, Character Theory of Finite Groups, Academic Press, 1976. Deeper reference for orthogonality and characters used in §26.
J. Rotman, An Introduction to the Theory of Groups, 4th ed., Springer GTM 148, 1995. Standard graduate reference covering Lagrange, Sylow, composition series, and computational group theory in one volume.
M. Aschbacher, Finite Group Theory, 2nd ed., Cambridge Studies in Advanced Mathematics 10, 2000. Reference for the classification of finite simple groups, into which A_8 and A_12 fit as members of the alternating family.
L. Saloff-Coste, Random walks on finite groups, in Probability on Discrete Structures, Springer, 263–346, 2004. A modern survey of mixing-time techniques for §24's framework.
WCA Software Team, TNoodle: WCA's official scramble generator. github.com/thewca/tnoodle — implements random-state scrambles and the 25-move HTM length used at competitions.