Searching for "Minimax Game Tree Searching." – sorted by Relevance.
-
Parallel Minimax Game-Tree Searching
- Exploration Parall`ele d'Arbres de Jeux Minimax Parallel Minimax Game-Tree Searching Van-Dat CUNG
- Add To MetaCart
-
A study of decision error in selective game tree search
- and the inaccuracy of static evaluation in a selective minimax game tree search. Error upper bounds are presented
- Cited by 4 (2 self) – Add To MetaCart
-
Nagging: A Scalable Fault-Tolerant Paradigm for Distributed Search
- that demonstrate nagging’s effectiveness and scalability as applied to A* search, ¢¡ minimax game tree search
- Add To MetaCart
-
A New Paradigm for Minimax Search
- H1 Abstract This paper introduces a new paradigm for minimax game-tree search algorithms. MT is a
- Add To MetaCart
-
Computer Go
- of minimax game tree search in Go are described in Section 4, and Section 5 discusses subproblems of the game
- Cited by 26 (0 self) – Add To MetaCart
-
A new paradigm for minimax search
- new paradigm for minimax game-tree search algorithms. MT is a memory-enhanced version of Pearl
- Cited by 16 (10 self) – Add To MetaCart
-
Robocode: Using games to teach artificial intelligence
- for different algorithms are provided to the students. These include a generic minimax game tree search
- Cited by 2 (0 self) – Add To MetaCart
-
Reinforcement learning for declarative optimization-based drama management
- to a minimax game-tree search problem as has been used for games like chess; however, because
- Cited by 14 (11 self) – Add To MetaCart
-
Reinforcement Learning for
- management problem similarly to a minimax game-tree search problem as has been used for games like chess
- Add To MetaCart
-
Heuristics in Monte Carlo Go
- function to estimate the value of the leaf nodes (Figure 2). Figure 1: Full minimax game tree search
- Cited by 1 (1 self) – Add To MetaCart

