(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
Location: Lecture 7 Segment 2 Expectimax Search
- navigate between lecture material using the slider at the top
- Expectimax search is an alternative to minimax search , which instead of maximizing the expected utility, minimax search minimizes the maximum loss.
- create concept: shift + click on graph
- change concept title: shift + click on existing concept
- link together concepts: shift + click drag from one concept to another
- remove concept from graph: click on concept then press delete/backspace
- add associated content to concept: click the small circle that appears on the node when hovering over it
- other actions: use the icons in the upper right corner to optimize the graph placement, preview the graph, or download a json representation