Game tree a path from A path is a sequence of distinct Xo Xo to x4 nodes y1,y2,y3,...,yn-1,yn such that yi and yit1 are adjacent,for i=1,2,...n-1.We say that this path is from y1 to yn. We can also use the sequence X2 of edges induced by these nodes to denote the path. The length of a path is the number of edges contained in the path. X6 Example 1:Xo,X2,X3,X7 is a path of length 3. Example 2:X4,X1,Xo,X2,X6 is a X7 path of length 4Game tree ◼ A path is a sequence of distinct nodes y1 , y2 , y3 , ..., yn-1 , yn such that yi and yi+1 are adjacent, for i=1, 2, ..., n-1. We say that this path is from y1 to yn . ◼ We can also use the sequence of edges induced by these nodes to denote the path. ◼ The length of a path is the number of edges contained in the path. ◼ Example 1: x0 , x2 , x3 , x7 is a path of length 3. ◼ Example 2: x4 , x1 , x0 , x2 , x6 is a path of length 4 9 x0 x1 x2 x3 x4 x5 x6 x7 x8 a path from x0 to x4