In particular, game trees must satisfy a few basic rules: First, a tree must have only one initial node, as opposed to the tree in figure 8.2. Second, every node of the tree has exactly one immediate predecessor except the initial node, which has no predecessor. Otherwise, nodes could have two predecessors. Third, multiple branches extending from the same node must have different action labels.