scientific article; zbMATH DE number 1944412

zbMath1046.91016MaRDI QIDQ4407717

Lars Jacobsen, Martin L. Demaine, Erik D. Demaine, J. Ian Munro, Rudolf Fleischer, Therese C. Biedl

Publication date: 2002

Full work available at URL: http://www.msri.org/communications/books/Book42/

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

NP-completepuzzle game

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Combinatorial games (91A46)

Related Items (7)

Complexity, appeal and challenges of combinatorial games ⋮ Phutball is PSPACE-hard ⋮ Defying gravity and gadget numerosity: the complexity of the Hanano puzzle ⋮ On the complexity of jelly-no-puzzle ⋮ \textsc{Hanano} puzzle is \textsf{NP}-hard ⋮ The complexity of flood filling games ⋮ An algorithmic analysis of the Honey-Bee game

This page was built for publication: