Computer simulations had suggested that the strategy that maximises the score 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 analytical treatment, backed by numerical calculations, that finds the optimal strategy to reach such a target.