BI Algorithm At terminal nodes, players already have the nodes marked with their utilities. At a non-terminal node \(v\), once all immediate successors are marked, the node is marked as follows: find the immediate successor \(d\) that has the highest utility for player \(\tau(v)\) (the players whose turn it is to move at \(v\)). Copy the utilities from \(d\) onto \(v\).