Combinatorics and Graph Theory

    

Solving the 106 Years Old 3^k Points Problem with the Clockwise-Algorithm

Authors: Marco Ripà

In this paper, we present the clockwise-algorithm that solves the extension in k-dimensions of the infamous nine-dot problem, the well known two-dimensional thinking outside the box puzzle. We describe a general strategy that constructively produces minimum length covering trails, for any k∈N−{0}, solving the NP-complete (3×3×⋯×3)-points problem inside a 3×3×⋯×3 hypercube. In particular, using our algorithm, we explicitly draw different covering trails of minimal length h(k) = (3^k − 1)/2, for k = 3, 4, 5. Furthermore, we conjecture that, for every k ≥ 1, it is possible to solve the 3^k-points problem with h(k) lines starting from any of the 3^k nodes, except from the central one. Finally, we cover 3×3×3 points with a tree of size 12.

Comments: Pages.

Download: PDF

Submission history

[v1] 2020-07-09 09:11:03
[v2] 2020-07-18 17:19:17

Unique-IP document downloads: 644 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

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.

comments powered by Disqus