Rubik’s Cube as a Turing-complete Computer

A guided research project in Algorithms & Discrete Mathematics.

← Algorithms & Discrete Mathematics projects

Experience Research Algorithms & Discrete Mathematics

Question

Can sequences of Rubik's Cube moves represent and carry out a general computation?

Carefully designed move sequences can change one encoded state while preserving the rest.
Carefully designed move sequences can change one encoded state while preserving the rest.

Goals

  • Encode computational states in cube configurations.
  • Construct move sequences that act as logical or state-transition rules.

Method

Treat the cube as a finite state system whose legal moves perform controlled changes.

  • Describe configurations and moves using permutations or group operations.
  • Design small gadgets that store symbols and update them through move sequences.
  • Trace a computation and verify that unintended cube pieces are restored.