We next present a number of modifications of the algorithm solve_constraints. The first is a more efficient implementation. The second extends the algorithm to handle non-strict comparisons. The third extend the algorithm to handle a combination of order-of-magnitude comparisons on distance with order comparisons, in a one-dimensional space.