Defying gravity and gadget numerosity: the complexity of the Hanano puzzle (Q6175086): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Walking through doors is hard, even without staircases: proving PSPACE-hardness via planar assemblies of door gadgets / rank | |||
Normal rank | |||
Latest revision as of 13:01, 4 December 2024
scientific article; zbMATH DE number 7729456
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Defying gravity and gadget numerosity: the complexity of the Hanano puzzle |
scientific article; zbMATH DE number 7729456 |
Statements
Defying gravity and gadget numerosity: the complexity of the Hanano puzzle (English)
0 references
17 August 2023
0 references
computational complexity
0 references
irreversible games
0 references
hardness of games
0 references
minimizing gadgets
0 references
