Graph Theory37 sections · 1633 units
Open in Course

Problem - Game on Tree (Part 4)

(What you learned)

Variations: What if some edges have weights and the goal is to maximize the sum?

Use minimax with numeric values instead of win/loss. What if players can skip turns?

Add a new kind of move and adjust the recursion to handle skips. What if there are multiple tokens?

Track all token positions and build a product tree. Each variation adds complexity to the state space but the backward induction framework stays the same.