The following pages link to (Q3395518):
Displaying 50 items.
- On the complexity of connection games (Q307770) (← links)
- Impartial games emulating one-dimensional cellular automata and undecidability (Q385042) (← links)
- UNO is hard, even for a single player (Q389942) (← links)
- Deciding the winner in \(k\) rounds for DISJOINT ARROWS, a new combinatorial partizan game (Q391980) (← links)
- From heaps of matches to the limits of computability (Q396877) (← links)
- Phutball is PSPACE-hard (Q410721) (← links)
- Approximability of the subset sum reconfiguration problem (Q489711) (← links)
- Gaming is a hard job, but someone has to do it! (Q489749) (← links)
- The kissing problem: how to end a gathering when everyone kisses everyone else goodbye (Q489765) (← links)
- Google Scholar makes it hard -- the complexity of organizing one's publications (Q495683) (← links)
- Linear-time algorithm for sliding tokens on trees (Q496016) (← links)
- Quell (Q500997) (← links)
- Partial-order Boolean games: informational independence in a logic-based model of strategic interaction (Q516248) (← links)
- Hanabi is NP-hard, even for cheaters who look at their cards (Q528493) (← links)
- Reconfiguration of list edge-colorings in a graph (Q713316) (← links)
- Generalized Pete's Pike is PSPACE-complete (Q899314) (← links)
- On a generalization of ``eight blocks to madness'' puzzle (Q906490) (← links)
- The complexity of Snake and undirected NCL variants (Q1623271) (← links)
- Trainyard is NP-hard (Q1623273) (← links)
- A simple proof that the \((n^{2} - 1)\)-puzzle is hard (Q1637231) (← links)
- Imperfect information in reactive modules games (Q1641035) (← links)
- Reconfiguration in bounded bandwidth and tree-depth (Q1686224) (← links)
- Two-player tower of Hanoi (Q1791283) (← links)
- \textsf{PSPACE}-complete two-color planar placement games (Q2002060) (← links)
- Token sliding on split graphs (Q2048202) (← links)
- The kangaroo problem (Q2055971) (← links)
- \textsf{PSPACE}-hardness of variants of the graph coloring game (Q2078618) (← links)
- PSPACE-completeness of reversible deterministic systems (Q2104136) (← links)
- On reconfigurability of target sets (Q2110378) (← links)
- Interactive physical ZKP for connectivity: applications to Nurikabe and Hitori (Q2117799) (← links)
- Backgammon is hard (Q2150573) (← links)
- Book review of: E. R. Berlekamp et al., Winning ways for your mathematical plays. (Q2153993) (← links)
- Invitation to combinatorial reconfiguration (Q2154076) (← links)
- Trains, games, and complexity: 0/1/2-player motion planning through input/output gadgets (Q2154096) (← links)
- PSPACE-completeness of two graph coloring games (Q2182325) (← links)
- Parameterized complexity of independent set reconfiguration problems (Q2192091) (← links)
- On the exact complexity of polyomino packing (Q2196557) (← links)
- Tracks from hell -- when finding a proof may be easier than checking it (Q2196558) (← links)
- Cooperating in video games? Impossible! Undecidability of team multiplayer games (Q2196560) (← links)
- Reconfiguration of list \(L(2,1)\)-labelings in a graph (Q2250462) (← links)
- Twenty years of progress of \(\mathrm{JCDCG}^3\) (Q2308489) (← links)
- Matchstick puzzles on a grid (Q2308506) (← links)
- Towards an algorithmic guide to Spiral Galaxies (Q2347000) (← links)
- Complexity of tiling a polygon with trominoes or bars (Q2411829) (← links)
- Complexity of Hamiltonian cycle reconfiguration (Q2633261) (← links)
- Shortest reconfiguration of sliding tokens on subclasses of interval graphs (Q2658043) (← links)
- Partial order games (Q2669153) (← links)
- Computational complexity of jumping block puzzles (Q2695336) (← links)
- Computational complexity of two pencil puzzles: Kurotto and Juosan (Q2695483) (← links)
- The connected greedy coloring game (Q2699943) (← links)
