The following pages link to (Q4779132):
Displayed 24 items.
- Strategies in competing subset selection (Q367644) (← links)
- Impartial coloring games (Q388789) (← links)
- UNO is hard, even for a single player (Q389942) (← links)
- Phutball is PSPACE-hard (Q410721) (← links)
- Hanabi is NP-hard, even for cheaters who look at their cards (Q528493) (← links)
- The complexity of node blocking for dags (Q616455) (← links)
- Zen puzzle garden is NP-complete (Q763503) (← links)
- On variants of vertex geography on undirected graphs (Q1627869) (← links)
- On the transformation capability of feasible mechanisms for programmable matter (Q1741488) (← links)
- Equilibrium paths in discounted supergames (Q1741494) (← links)
- Ice sliding games (Q1791286) (← links)
- Pushing lines helps: efficient universal centralised transformations for programmable matter (Q2182711) (← links)
- Wooden geometric puzzles: Design and hardness proofs (Q2272190) (← links)
- Twenty years of progress of \(\mathrm{JCDCG}^3\) (Q2308489) (← links)
- Towards an algorithmic guide to Spiral Galaxies (Q2347000) (← links)
- On bichromatic triangle game (Q2448874) (← links)
- Games on triangulations (Q2570126) (← links)
- PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation (Q2570127) (← links)
- Restricted Power - Computational Complexity Results for Strategic Defense Games (Q3305735) (← links)
- Layered Battleship Game Changer Password System (Q5106274) (← links)
- Playing Savitch and Cooking Games (Q5187817) (← links)
- A Global Approach for Solving Edge-Matching Puzzles (Q5250017) (← links)
- On the computational complexity of bridgecard (Q5963617) (← links)
- (Q6179342) (← links)