scientific article
From MaRDI portal
Publication:3574139
zbMath1192.91057MaRDI QIDQ3574139
Publication date: 9 July 2010
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial games (91A46)
Related Items (3)
On the PSPACE-completeness of Peg Duotaire and other Peg-Jumping Games ⋮ \textsf{PSPACE}-complete two-color planar placement games ⋮ Unnamed Item
This page was built for publication:
