In this paper, we show enhanced upper bounds of the nontrivial n_1 × n_2 × n_3 points problem for every n_1 <= n_2 <= n_3 < 6. We present new patterns that drastically improve the previously known algorithms for finding minimum-link covering paths.

## Citation

An old version of the present paper has been published on "In-Sight: Independent Interview-Based Journal", Issue 22.B, Idea: Outliers & Outsiders (Part Eighteen), 2020. Available at: https://in-sightpublishing.com/2020/02/08/solving-the-n_1xn_2xn_3-points-problem-for-n_3-6-ripa/