Advances in finding ideal play on poset games
From MaRDI portal
Publication:3390718
Abstract: Poset games are a class of combinatorial game that remain unsolved. Soltys and Wilson proved that computing wining strategies is in extbf{PSPACE} and aside from special cases such as Nim and N-Free games, extbf{P} time algorithms for finding ideal play are unknown. This paper presents methods calculate the nimber of posets games allowing for the classification of winning or losing positions. The results present an equivalence of ideal strategies on posets that are seemingly unrelated.
Recommendations
Cites work
- scientific article; zbMATH DE number 2004829 (Why is no real title available?)
- scientific article; zbMATH DE number 1862431 (Why is no real title available?)
- scientific article; zbMATH DE number 2124071 (Why is no real title available?)
- scientific article; zbMATH DE number 7075886 (Why is no real title available?)
- Chomp, Recurrences and Chaos(?)
- Lessons in play. An introduction to combinatorial game theory
- On the complexity of computing winning strategies for finite poset games
- Sterling Stirling play
- Three-rowed CHOMP
Cited in
(7)- scientific article; zbMATH DE number 2124071 (Why is no real title available?)
- On the complexity of computing winning strategies for finite poset games
- Comparative Study of Approximate Strategies for Playing Sum Games Based on Subgame Types
- Enumerative properties of posets corresponding to a certain class of games of no strategy
- Flipping the winner of a poset game
- Advances in finding ideal play on poset games
- Algorithms for lattice games
This page was built for publication: Advances in finding ideal play on poset games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3390718)
