The following pages link to (Q4967182):
Displaying 17 items.
- On the complexity of computing winning strategies for finite poset games (Q537910) (← links)
- Flipping the winner of a poset game (Q763499) (← links)
- Winning positions in simplicial Nim (Q976744) (← links)
- Recent results and questions in combinatorial game complexities (Q1583532) (← links)
- Chomp on numerical semigroups (Q1649927) (← links)
- Complexity, appeal and challenges of combinatorial games (Q1884999) (← links)
- Chomp on generalized Kneser graphs and others (Q2230537) (← links)
- Proper 2-coloring game on some trees (Q2420567) (← links)
- Pomax games -- a family of integer-valued partizan games played on posets (Q2830437) (← links)
- Advances in finding ideal play on poset games (Q3390718) (← links)
- (Q3426920) (← links)
- Complexity of games (Q3973044) (← links)
- (Q4407721) (← links)
- Deciding the Winner of an Arbitrary Finite Poset Game Is PSPACE-Complete (Q5326586) (← links)
- (Q5384203) (← links)
- A vertex and edge deletion game on graphs (Q5384206) (← links)
- The Game of n-Player Shove and Its Complexity (Q5392650) (← links)