Pages that link to "Item:Q1138494"
From MaRDI portal
The following pages link to Hex ist Pspace-vollständig. (Hex is Pspace-complete) (Q1138494):
Displayed 29 items.
- On the complexity of connection games (Q307770) (← links)
- Shannon-like games are difficult (Q686516) (← links)
- An algorithmic analysis of the Honey-Bee game (Q714789) (← links)
- Solving \(7\times 7\) hex with domination, fill-in, and virtual connections (Q817784) (← links)
- Computing a perfect strategy for nxn chess requires time exponential in n (Q1156090) (← links)
- Theory of annihilation games. I (Q1168901) (← links)
- A difficulty in particular Shannon-like games (Q1173983) (← links)
- The complexity of coloring games on perfect graphs (Q1202928) (← links)
- Geography (Q1210545) (← links)
- The Othello game on an \(n\times n\) board is PSPACE-complete (Q1314386) (← links)
- Recent results and questions in combinatorial game complexities (Q1583532) (← links)
- TANTRIX\(^{\text{TM}}\) rotation puzzles are intractable (Q1765243) (← links)
- Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete. (Q1853560) (← links)
- Rikudo is NP-complete (Q2118858) (← links)
- Backgammon is hard (Q2150573) (← links)
- \(\mathsf{NP}\)-completeness of the game Kingdomino\(^\text{TM}\) (Q2182309) (← links)
- QUIXO is EXPTIME-complete (Q2203590) (← links)
- Topological games at Princeton, a mathematical memoir (Q2389292) (← links)
- Hex and combinatorics (Q2433713) (← links)
- The maker-breaker largest connected subgraph game (Q2680987) (← links)
- Havannah and TwixT are PSPACE-complete (Q2947922) (← links)
- (Q3390714) (← links)
- Classifying the computational complexity of problems (Q3781088) (← links)
- Remarks on History and Presence of Game Tree Search and Research (Q4915265) (← links)
- On the combinatorial value of Hex positions (Q5095319) (← links)
- The largest connected subgraph game (Q5918781) (← links)
- The largest connected subgraph game (Q5925553) (← links)
- A hierarchical approach to computer Hex (Q5958203) (← links)
- Games solved: Now and in the future (Q5958209) (← links)