Solving the Rubik's Cube Optimally is NP-complete (Q3304120)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving the Rubik's Cube Optimally is NP-complete |
scientific article |
Statements
5 August 2020
0 references
Rubik's Cube
0 references
combinatorial puzzles
0 references
NP-hardness
0 references
group theory
0 references
Hamiltonicity
0 references
cs.CC
0 references
cs.CG
0 references
math.CO
0 references
