Finding the Shortest Move-Sequence in the Graph-Generalized 15-Puzzle Is NP-Hard (Q3088169)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding the Shortest Move-Sequence in the Graph-Generalized 15-Puzzle Is NP-Hard |
scientific article |
Statements
Finding the Shortest Move-Sequence in the Graph-Generalized 15-Puzzle Is NP-Hard (English)
0 references
19 August 2011
0 references
NP-completeness
0 references
games' complexity
0 references
computational group theory
0 references
