Pages that link to "Item:Q3574125"
From MaRDI portal
The following pages link to Playing Games with Algorithms: Algorithmic Combinatorial Game Theory (Q3574125):
Displaying 17 items.
- On the complexity of connection games (Q307770) (← links)
- Impartial games emulating one-dimensional cellular automata and undecidability (Q385042) (← links)
- From heaps of matches to the limits of computability (Q396877) (← links)
- Permutation reconstruction from differences (Q463039) (← links)
- Gaming is a hard job, but someone has to do it! (Q489749) (← links)
- An algorithmic analysis of the Honey-Bee game (Q714789) (← links)
- Hashiwokakero is NP-complete (Q990945) (← links)
- Threes!, Fives, 1024!, and 2048 are hard (Q1623263) (← links)
- The complexity of Snake and undirected NCL variants (Q1623271) (← links)
- A simple proof that the \((n^{2} - 1)\)-puzzle is hard (Q1637231) (← links)
- Two-player tower of Hanoi (Q1791283) (← links)
- \textsf{PSPACE}-complete two-color planar placement games (Q2002060) (← links)
- Sequentially Swapping Colored Tokens on Graphs (Q4622769) (← links)
- Complexity limitations on one-turn quantum refereed games (Q6038714) (← links)
- Token Swapping on Trees (Q6045462) (← links)
- Particle computation: complexity, algorithms, and logic (Q6150976) (← links)
- Puzzle and dragons is hard (Q6204537) (← links)
