  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.
