The complexity of solitaire
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- An Optimal Parallel Algorithm for Formula Evaluation
- Complexity results for standard benchmark domains in planning
- Minesweeper is NP-complete.
- On uniformity within \(NC^ 1\)
- Planar and grid graph reachability problems
- Search in the patience game `Black Hole'
Cited in
(13)- On the computational complexity of bridgecard
- Hanabi is NP-complete, even for cheaters who look at their cards
- The Complexity of Solitaire
- Lowering the Odds for "Even Up"
- scientific article; zbMATH DE number 5925087 (Why is no real title available?)
- 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
- UNO is hard, even for a single player
- Hanabi is NP-hard, even for cheaters who look at their cards
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)
