A method using dynamic programming for solving the optimum pit limit problem was presented in an earlier paper. A recent issue of this journal contained some contributed discussion on the implementation of this technique. In this paper we provide some additional ideas and possible options one can incorporate into the method. In particular, an efficient procedure for obtaining further optimum pit outlines on extensions of the original block model is described.