Advances in finding ideal play on poset games

Poset games are a class of combinatorial game that remain unsolved. Soltys and Wilson proved that computing wining strategies is in \textbf{PSPACE} and aside from special cases such as Nim and N-Free games, \textbf{P} time algorithms for finding ideal play are unknown. This paper presents methods ca...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2021-01
Main Authors: Clow, Alexander, Finbow, Stephen
Format: Article
Language:English
Subjects:
Algorithms
Combinatorial analysis
Games
Set theory
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Poset games are a class of combinatorial game that remain unsolved. Soltys and Wilson proved that computing wining strategies is in \textbf{PSPACE} and aside from special cases such as Nim and N-Free games, \textbf{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.
ISSN:2331-8422