expectimax search

(50 minutes to learn)


Expectimax search is a search/decision-making algorithm that maximizes the average (expected) reward. It is typically applied to trees that have stochastic nodes, where the outcome of an action is uncertain.


This concept has the prerequisites:

Core resources (read/watch one of the following)


EdX Artificial Intelligence
Authors: Pieter Abbeel,Dan Klein
Other notes:
  • navigate between lecture material using the slider at the top

See also

  • Expectimax search is an alternative to minimax search , which instead of maximizing the expected utility, minimax search minimizes the maximum loss.