The complexity of solitaire
type: Item
instance of: scholarly article
title: The complexity of solitaire
zbMATH Open document ID: 1194.68123
author: Luc Longpré
author: Pierre McKenzie
published in: Theoretical Computer Science
publication date: 2009-11-06T00:00:00Z
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 5626893
zbMATH Keywords: computational complexity
zbMATH Keywords: completeness
zbMATH Keywords: games
zbMATH Keywords: solitaire
MaRDI profile type: Publication
full work available at URL: j.tcs.2009.08.027
OpenAlex ID: W2057795683
cites work: Planar and grid graph reachability problems
cites work: On uniformity within \(NC^ 1\)
cites work: An Optimal Parallel Algorithm for Formula Evaluation
cites work: Complexity results for standard benchmark domains in planning
cites work: Q5435012
cites work: Minesweeper is NP-complete.
cites work: Q4298260
DOI: 10.1016/J.TCS.2009.08.027
Recommended article: The Complexity of Solitaire
Recommended article: The Algorithmics of Solitaire-Like Games
Recommended article: Complexity of scorpion solitaire and applications to klondike
Recommended article: Q3013479
Recommended article: Solitaire automata
Recommended article: The solitaire clobber game and correducibility
Recommended article: Domino Games and Complexity
Recommended article: Fool's solitaire on graphs
Recommended article: Analysis of a game of graph solitaire
description: scientific article; zbMATH DE number 5626893