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 the normal view instead:
scientific article; zbMATH DE number 6882162
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple proof that the \((n^{2} - 1)\)-puzzle is hard |
scientific article; zbMATH DE number 6882162 |
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
0.86170304
0 references
0 references
0.8341239
0 references
0.8259604
0 references
0.82462144
0 references
0.8236449
0 references
0.8214694
0 references
0.8197143
0 references
