The following pages link to GO Is Polynomial-Space Hard (Q3873542):
Displayed 50 items.
- On the complexity of connection games (Q307770) (← 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)
- Phutball is PSPACE-hard (Q410721) (← links)
- Hanabi is NP-hard, even for cheaters who look at their cards (Q528493) (← links)
- The one-round Voronoi game replayed (Q705543) (← links)
- An algorithmic analysis of the Honey-Bee game (Q714789) (← links)
- On the shortest path game (Q729795) (← links)
- Turing machines with access to history (Q751802) (← links)
- The complexity of two-player games of incomplete information (Q800838) (← links)
- Learning to score final positions in the game of Go (Q817792) (← links)
- The game chromatic number and the game colouring number of cactuses (Q845991) (← links)
- New complexity results about Nash equilibria (Q932810) (← links)
- A finite set of functions with an EXPTIME-complete composition problem (Q955009) (← links)
- PSPACE-completeness of an escape problem (Q975459) (← links)
- PSPACE-Hardness of some combinatorial games (Q1090274) (← links)
- Single-suit two-person card play (Q1093570) (← links)
- Storage allocation is NP-hard (Q1147512) (← links)
- Computing a perfect strategy for nxn chess requires time exponential in n (Q1156090) (← links)
- Playing disjunctive sums is polynomial space complete (Q1159098) (← links)
- Theory of annihilation games. I (Q1168901) (← links)
- Undirected edge geography (Q1210301) (← links)
- Geography (Q1210545) (← links)
- Complexity of path-forming games (Q1210546) (← links)
- The Othello game on an \(n\times n\) board is PSPACE-complete (Q1314386) (← links)
- A short certificate of the number of universal optimal strategies for stopping simple stochastic games (Q1350746) (← links)
- The Go polynomials of a graph. (Q1426435) (← links)
- Recent results and questions in combinatorial game complexities (Q1583532) (← links)
- Applying adversarial planning techniques to Go (Q1589506) (← links)
- Decision algorithms for multiplayer noncooperative games of incomplete information (Q1609052) (← links)
- On variants of vertex geography on undirected graphs (Q1627869) (← links)
- TANTRIX\(^{\text{TM}}\) rotation puzzles are intractable (Q1765243) (← links)
- Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete. (Q1853560) (← links)
- Complexity, appeal and challenges of combinatorial games (Q1884999) (← links)
- Rikudo is NP-complete (Q2118858) (← links)
- On the computational complexities of various geography variants (Q2127615) (← links)
- \(\mathsf{NP}\)-completeness of the game Kingdomino\(^\text{TM}\) (Q2182309) (← links)
- On the number of go positions on lattice graphs (Q2380058) (← links)
- The shortest connection game (Q2403801) (← links)
- On the fairness and complexity of generalized \(k\)-in-a-row games (Q2456362) (← links)
- Havannah and TwixT are PSPACE-complete (Q2947922) (← links)
- Single-Player and Two-Player Buttons & Scissors Games (Q2958087) (← links)
- On the PSPACE-completeness of Peg Duotaire and other Peg-Jumping Games (Q3305726) (← links)
- (Q3390714) (← links)
- Remarks on History and Presence of Game Tree Search and Research (Q4915265) (← links)
- THE FRONTIER OF DECIDABILITY IN PARTIALLY OBSERVABLE RECURSIVE GAMES (Q4923289) (← links)
- Lower bounds for multiplayer noncooperative games of incomplete information (Q5948765) (← links)
- Computer Go (Q5958205) (← links)
- Computer Go: An AI oriented survey (Q5958709) (← links)
- (Q6126489) (← links)