Game Playing
- Zero-Sum
- 2 Players
- Discrete Games
- Deterministic (not dice, shuffled, cards)
- Perfect Information
- Alternating
Tic-Tac-Toe
X is a wining position
if X has won (base case)
3 X is In a Row
or X's move and X has a move to wining pos
or O's move and whatever O dpes X is in a wining pos
Game Tree
Vertex: state e.g. Board + whose move
Arcs of vertex V : possible moves
Leaves - Final States (T: X has won, F: otherwise)
AND-OR game tree
If x moves in S, then V(s) = V (true or) for all children
if o moves in S, then V(s) = ^ (true and) for all children