---

In this paper, we present a new algorithm for the "n_1 × n_2 × ... × n_k points problem" (an extension of the well-known "nine dots puzzle" of Samuel Loyd), able to solve completely the problem for the case "k=2" and, at the same time, provide lower upper bounds for the other cases.