Solitaire automata
The notion of a solitaire automaton is introduced to model the class of solitaire games. Space and time bounded solitaire automata with varying degrees of information are investigated. In general, solitaire automata have partial or imperfect information. The principal results are (i) s(n)-space bounded solitaire automata are equivalent to Turing machines which run in space exponential in s(n) and (ii) t(n)-time bounded solitaire automata are equivalent to alternating Turing machines which run in time t(n). The power of solitaire automata is also determined when the information is perfect or zero.
- The complexity of solitaire
- Decision algorithms for multiplayer noncooperative games of incomplete information
- Probabilistic game automata
- scientific article; zbMATH DE number 5925087 (Why is no real title available?)
- The Complexity of Solitaire
- Classifying the computational complexity of problems
- scientific article; zbMATH DE number 8789 (Why is no real title available?)
- Triangle solitaire
- Turing machines with access to history
This page was built for publication: Solitaire automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1058475)