MDP

Move around the board, answering questions. Collect 6 different color wedges, return to the center first to win.

One-player version: minimize the time to completion.

Assume we have a fixed probability of getting a question right in each category. Given a roll of the die, where should you move?

Can set this up and solve it as an MDP to find an optimal strategy.

How many states?


next up previous
Next: Bellman Equations Up: TRIVIAL PURSUIT Previous: TRIVIAL PURSUIT