Pages that link to "Item:Q1156090"
From MaRDI portal
The following pages link to Computing a perfect strategy for nxn chess requires time exponential in n (Q1156090):
Displaying 23 items.
- Hanabi is NP-hard, even for cheaters who look at their cards (Q528493) (← links)
- An algorithmic analysis of the Honey-Bee game (Q714789) (← links)
- A finite set of functions with an EXPTIME-complete composition problem (Q955009) (← links)
- On the complexity of chess (Q1054641) (← links)
- Single-suit two-person card play (Q1093570) (← links)
- Theory of annihilation games. I (Q1168901) (← 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)
- Complexity of path discovery game problems (Q1566737) (← links)
- Recent results and questions in combinatorial game complexities (Q1583532) (← links)
- On variants of vertex geography on undirected graphs (Q1627869) (← links)
- Domino-tiling games (Q1822501) (← links)
- Complexity, appeal and challenges of combinatorial games (Q1884999) (← links)
- QUIXO is EXPTIME-complete (Q2203590) (← links)
- The computational complexity of Angry Birds (Q2302303) (← links)
- (Q3305770) (← links)
- (Q3390714) (← links)
- Remarks on History and Presence of Game Tree Search and Research (Q4915265) (← links)
- Games, Puzzles and Treewidth (Q5042461) (← links)
- Playing Savitch and Cooking Games (Q5187817) (← links)
- Computer Go: An AI oriented survey (Q5958709) (← links)
- (Q6065414) (← links)
