A simple proof that the \((n^{2} - 1)\)-puzzle is hard (Q1637231)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A simple proof that the \((n^{2} - 1)\)-puzzle is hard |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple proof that the \((n^{2} - 1)\)-puzzle is hard |
scientific article |
Statements
A simple proof that the \((n^{2} - 1)\)-puzzle is hard (English)
0 references
7 June 2018
0 references
\((n^2 - 1)\)-puzzle
0 references
complexity of games
0 references
NP-hardness
0 references
rectilinear Steiner tree
0 references
