The complexity of Snake and undirected NCL variants
type: Item
instance of: scholarly article
title: The complexity of Snake and undirected NCL variants
zbMATH Open document ID: 1402.68088
author: Marzio De Biasi
author: Tim Ophelders
published in: Theoretical Computer Science
publication date: 2018-11-23T00:00:00Z
full work available at URL: the-complexity-of-snake-and-undirected-ncl-variants(110a6b03-3609-4787-a566-656d6f52f5b6).html
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 91A43
zbMATH DE Number: 6983751
zbMATH Keywords: games
zbMATH Keywords: puzzles
zbMATH Keywords: motion planning
zbMATH Keywords: nondeterministic constraint logic
zbMATH Keywords: PSPACE
MaRDI profile type: Publication
OpenAlex ID: W2767722150
cites work: The train marshalling problem
cites work: Playing Games with Algorithms: Algorithmic Combinatorial Game Theory
cites work: PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
cites work: Q3395518
cites work: Simple wriggling is hard unless you are a fat hippo
cites work: On two geometric problems related to the travelling salesman problem
cites work: On Embedding a Graph in the Grid with the Minimum Number of Bends
cites work: Parameterized Complexity of Graph Constraint Logic
cites work: Gaming is a hard job, but someone has to do it!
DOI: 10.1016/J.TCS.2017.10.031
description: scientific article; zbMATH DE number 6983751