A simple proof that the \((n^{2} - 1)\)-puzzle is hard (Q1637231): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Revision as of 04:10, 5 March 2024
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
