4 papers · 1 filter
The Two-Level Poset Game is PSPACE-Complete
Kengo Hashimoto
Poset games form a fundamental class of combinatorial games that includes classical games such as Nim and Chomp. Determining the outcome of a poset game is known to be PSPACE-compl…
The Computational Complexity of the Ungar Games on Distributive Lattices
Kengo Hashimoto
The Ungar game, introduced by Defant et al., is a combinatorial game played on a finite lattice, which originates from a geometric transformation introduced by Ungar to resolve Sco…
Partizan Serial Nim
Kengo Hashimoto
A combinatorial game is a two-player game without hidden information or chance elements. The main object of combinatorial game theory is to determine the outcome (i.e., which playe…
Ordinal Sums with Substitution of Impartial Games
Kengo Hashimoto
A combinatorial game is a two-player game without hidden information or chance elements. The disjunctive sum of games and is the game in which and are playe…