Chess-like Games Are Dominance Solvable in at Most Two Steps.
Christian EwerhartPublished in: Games Econ. Behav. (2000)
Keyphrases
- game playing
- computer chess
- game tree search
- game tree
- imperfect information
- games played
- board game
- general game playing
- evaluation function
- np hard
- video games
- artificial intelligence
- human players
- np complete
- special case
- perfect information
- tic tac toe
- computer games
- brute force
- neural network
- game design
- human computation
- heuristic search
- monte carlo tree search
- tree search
- online game
- game development
- nash equilibrium
- computational complexity
- case study
- alpha beta search
- decision making