Complexity, appeal and challenges of combinatorial games
Theoretical Computer Science - Algorithmic combinatorial game theory
Nash-solvable two-person symmetric cycle game forms
Discrete Applied Mathematics
Deciding the winner in k rounds for DISJOINT ARROWS, a new combinatorial partizan game
Theoretical Computer Science
UNO is hard, even for a single player
Theoretical Computer Science
Hi-index | 5.23 |