The Othello game on an n*n board is PSPACE-complete.
Shigeki IwataTakumi KasaiPublished in: Theor. Comput. Sci. (1994)
Keyphrases
- board game
- pspace complete
- np complete
- game playing
- model checking
- decision problems
- satisfiability problem
- computer games
- game design
- strips planning
- game tree
- tree search
- minimax search
- game tree search
- urban planning
- tree automata
- temporal logic
- computer programs
- phase transition
- utility function
- opponent modeling
- evaluation function
- finite automata
- causal graph
- temporal difference learning
- video games
- branch and bound
- monte carlo
- constraint satisfaction problems
- multi agent systems
- decision making