Advances in finding ideal play on poset games
From MaRDI portal
Publication:3390718
zbMATH Open1490.91030arXiv2101.09402MaRDI QIDQ3390718FDOQ3390718
Authors: Alexander Clow, Stephen Finbow 
Publication date: 25 March 2022
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.
Full work available at URL: https://arxiv.org/abs/2101.09402
Recommendations
Cites Work
- Chomp, Recurrences and Chaos(?)
- Three-rowed CHOMP
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the complexity of computing winning strategies for finite poset games
- Sterling Stirling play
- Lessons in play. An introduction to combinatorial game theory
Cited In (7)
- 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
- Title not available (Why is that?)
Uses Software
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)
