Advances in finding ideal play on poset games
Alexander Clow, Stephen Finbow · 2022
Poset games are a class of combinatorial games that remain unsolved. Soltys and Wilson proved that computing winning strategies is in PSPACE and aside from particular cases such as nim and N-Free games, P time algorithms for finding ideal play are unknown. In this paper, we present methods to calculate the nimber of poset games allowing for the classification of winning or losing positions. The results present an equivalence of ideal strategies on posets that are seemingly unrelated.