Considering a generic nxn grid, what is the minimum number of straight lines that you need to fitall the dots (without lifting the pencil from your paper)?
Answer: for n=1, you need (at least) 1 line; for n=2, you need (at least) 3 lines…
3, you need (at least) 2*n-2 lines
.To understand this result, you can look at the following solving pattern, using the same strategy to
solve any nxn puzzle (for n>3). You can easily see that you need two more lines for any n’:=n+1
3: To fit nxn dots (into the center and without lifting your pencil from the paper), for n≥3, you
need (at least) 2n-2 straight lines.
A consequence of this proof is that, for n→∞, the size of the paper that you need to draw your
solution with your pencil, tends to be the same one of the area encompassed by the most externaldots.