Computer simulations had suggested that the strategy that maximises the sco
re on each turn in the dice game described by Roters (1998) may not be the
optimal way to reach a given target in the shortest time. We give an analyt
ical treatment, backed by numerical calculations, that finds the optimal st
rategy to reach such a target.