Reduce computational complexity #2
Description
The full probability tree creation is time consuming. Each inning could be thought of as memory-less with N starting possibilities, where N is the number of players. In other words each inning will only start with one of the N players. This means that you really only need to calculate N subtrees and collapse their probabilities.