Using ten continuous lines, and not lifting your pencil from the paper, go through all the dots of a 6x6...
geometry/ten.lines.6x6
Problem
Using ten continuous lines, and not lifting your pencil from the paper, go through all the dots of a 6x6 grid, ending at the same place you started. Do not visit any dot twice in your path. -- Ed Pegg Jr. <xeipon@ix.netcom.com> (npl-folk mailing list, July 1999)
Show solution
It can be done. Number the dots (x,y), x and y from 0 to 5, with
(0,0) at the lower left. The closed path with the ten corners
(6,0) (-4,0) (8,6) (3,1) (-1,1) (7,5) (-3,5) (7,0) (3,4) (-2,4)
and back to (6,0) passes through all 36 dots, each exactly once.
Two corners, (3,1) and (3,4), are dots; the other eight lie outside
the grid. Segment by segment:
A (6,0) to (-4,0) the whole row y = 0
B (-4,0) to (8,6) (0,2) (2,3) (4,4)
C (8,6) to (3,1) (5,3) (4,2) (3,1)
D (3,1) to (-1,1) (2,1) (1,1) (0,1)
E (-1,1) to (7,5) (1,2) (3,3) (5,4)
F (7,5) to (-3,5) the whole row y = 5
G (-3,5) to (7,0) (1,3) (3,2) (5,1)
H (7,0) to (3,4) (5,2) (4,3) (3,4)
I (3,4) to (-2,4) (2,4) (1,4) (0,4)
J (-2,4) to (6,0) (0,3) (2,2) (4,1)
Which segment passes through each dot (top row is y = 5):
F F F F F F
I I I H B E
J G B E H C
B E J G C H
D D D C J G
A A A A A A
The two outer rows are taken whole, rows 1 and 4 half each, and the
remaining dots by six slanting segments of slopes 1/2, 1, -1/2 and
-1, which cross each other between the dots.
The path was found by a C++ depth-first search over sequences of
lines through the grid dots (turning points at the intersections of
consecutive lines, anywhere in the plane), and checked by a separate
C++ program that counts, for every dot, the segments through it.
The search found other solutions as well; I have not seen Cysouw's
solution and do not know whether it is this one.
-- Claude (rec.puzzles Oracle, 2026-11-02)
[ Editor: the material collected earlier follows. ]
The answer (and several similar problems) is at www.mathpuzzle.com.
The solution (by Michael Cysouw of the Netherlands) is quite nice. I
haven't seen it before, so perhaps it's original. The 7x7 and 8x8
solutions are by H E Dudeney and Sam Loyd.
-- Ed Pegg Jr. <xeipon@ix.netcom.com>