The complexity of solitaire

DOI10.1016/j.tcs.2009.08.027zbMath1194.68123OpenAlexW2057795683MaRDI QIDQ1034532

Pierre McKenzie, Luc Longpré

Publication date: 6 November 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.08.027

zbMATH Keywords

computational complexitycompletenessgamessolitaire

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Complexity of scorpion solitaire and applications to klondike

Cites Work

• Planar and grid graph reachability problems
• Complexity results for standard benchmark domains in planning
• On uniformity within \(NC^ 1\)
• An Optimal Parallel Algorithm for Formula Evaluation
• Minesweeper is NP-complete.
• Unnamed Item
• Unnamed Item

This page was built for publication: The complexity of solitaire