## The n X n X n Points Problem Optimal Solution

**Authors:** Marco Ripà

We provide an optimal strategy to solve the n X n X n points problem inside the box, considering only 90° turns, and at the same time a pattern able to drastically lower down the known upper bound. We use a very simple spiral frame, especially if compared to the previous plane by plane approach, that significantly reduces the number of straight lines connected at their end-points necessary to join all the n3 dots. In the end, we combine the square spiral frame with the rectangular spiral pattern in the most profitable way, in order to minimize the difference hu(n) − hl(n) between the upper and the lower bound, proving that it is ≤ 0.5 ∙ n ∙ (n + 3), for any n > 1.

**Comments:** 9 Pages.

**Download:** **PDF**

### Submission history

[v1] 2015-08-24 19:58:13

[v2] 2015-08-30 18:35:17

**Unique-IP document downloads:** 138 times

**Add your own feedback and questions here:**

*You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.*

*
*