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 16 items.
- Shannon-like games are difficult (Q686516) (← 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)
- Topological games at Princeton, a mathematical memoir (Q2389292) (← links)
- Hex and combinatorics (Q2433713) (← links)
- Classifying the computational complexity of problems (Q3781088) (← links)
- A hierarchical approach to computer Hex (Q5958203) (← links)
- Games solved: Now and in the future (Q5958209) (← links)