1
Q
What is alpha beta pruning?
A
When exploring nodes n, if a node m further up the tree, is better than a state we can achieve here, we can prune everything after n.
2
Q
How is alpha beta pruning implemented?
A
Maintains best choice for max, and best choice so far for min.
Prunes values worse than best choice so far.
CS255 - SEARCHES
flashcards
Decks in class (20)
# Cards
-
Greedy Best First Search1
-
A* Search3
-
Heuristics1
-
Iterative Deepning1
-
tree search2
-
Bi - directional search1
-
Depth First Branch and Bound1
-
Hill Climbing Search1
-
Stochastic Local Search1
-
Simulated Annealing2
-
Beam Search2
-
Genetic Algorithms1
-
Parrallel Search1
-
Lowest Cost First Search1
-
Heuristic depth first search1
-
Bounded Depth First Search1
-
Search Optimisation4
-
Dynammic Programming Search2
-
Minimax2
-
Alpha Beta Pruning2
