Game tree ■ A game tree has a set of a path from Xo a node nodes and a set of edges Xo to x4 such that > each edge connects two nodes (these two X2 nodes are said to be adjacent) for any pair of nodes, X3 there is a unique path X6 that connects these two nodes X8 an edge connecting nodes x1 and x5 Game tree ◼ A game tree has a set of nodes and a set of edges such that ➢ each edge connects two nodes (these two nodes are said to be adjacent) ➢ for any pair of nodes, there is a unique path that connects these two nodes 8 x0 x1 x2 x3 x4 x5 x6 x7 x8 a node an edge connecting nodes x1 and x5 a path from x0 to x4