The complexity of solitaire

DOI10.1016/J.TCS.2009.08.027zbMATH Open1194.68123OpenAlexW2057795683MaRDI QIDQ1034532FDOQ1034532

Authors: Luc Longpré, Pierre McKenzie 

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

Recommendations

• The Complexity of Solitaire
• The algorithmics of solitaire-like games
• Complexity of Scorpion solitaire and applications to Klondike
• scientific article; zbMATH DE number 5925087
• Solitaire automata
• The solitaire clobber game and correducibility
• Domino Games and Complexity
• Fool's solitaire on graphs
• Analysis of a game of graph solitaire

zbMATH Keywords

computational complexitycompletenessgamessolitaire

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• On uniformity within \(NC^ 1\)
• An Optimal Parallel Algorithm for Formula Evaluation
• Planar and grid graph reachability problems
• Minesweeper is NP-complete.
• Complexity results for standard benchmark domains in planning
• Search in the patience game `Black Hole'

Cited In (13)

• Hanabi is NP-complete, even for cheaters who look at their cards
• The Complexity of Solitaire
• Lowering the Odds for "Even Up"
• Title not available (Why is that?)
• All solutions to the immobilizer problem
• A study of a generalization of a card problem
• Solitaire automata
• Optimal token allocation in solitaire knock'm down
• Complexity of Scorpion solitaire and applications to Klondike
• The solitaire clobber game and correducibility
• On the computational complexity of bridgecard
• Hanabi is NP-hard, even for cheaters who look at their cards
• UNO is hard, even for a single player

This page was built for publication: The complexity of solitaire

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1034532)