Long description

From the previous diagram (Figure 1), the decision tree has two branches, the top is for A and bottom is for B.

Following the top branch (for A) you come to a chance node called ‘win’ which then splits into two further branches, for the party, called J and K.

Each of these branches arrives at another chance node called ‘friendly’.

Each of these has two further branches form each node, called ‘yes’ or ‘no’.This is repeated in the lower branch for B.