New results of exhaustive search in the game Amazons.
Raymond Georg SnatzkePublished in: Theor. Comput. Sci. (2004)
Keyphrases
- exhaustive search
- brute force
- computational complexity
- dynamic programming
- nearest neighbor search
- search space
- search methods
- computer games
- game design
- game theory
- computationally feasible
- simulated annealing
- game playing
- game play
- optimal solution
- game based learning
- solution space
- game theoretic
- monte carlo tree search
- lower bound
- nash equilibrium
- video games
- virtual world
- imperfect information
- educational games
- serious games
- mathematical model
- perfect information
- board game
- cooperative game
- greedy search
- online game
- learning experience
- cost function
- search algorithm