Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/18/84; site ecsvax.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!bellcore!decvax!mcnc!ecsvax!hal
From: hal@ecsvax.UUCP
Newsgroups: net.puzzle
Subject: 5 boxes
Message-ID: <1146@ecsvax.UUCP>
Date: Sat, 1-Feb-86 20:26:39 EST
Article-I.D.: ecsvax.1146
Posted: Sat Feb  1 20:26:39 1986
Date-Received: Mon, 3-Feb-86 04:49:31 EST
Distribution: net
Organization: North Carolina Educational Computing Service
Lines: 32




Here's an old one that I have yet to figure out myself.  It may not be
possible, but if you know the solution, let's see it.

Here is a diagram consisting of five squares, two on top and three on
bottom.  It has been divided into 16 lines, which I have numbered as 
shown:


   _____1____________2____
  |           |           |
 3|          4|          5|
  |___6____7__|__8_____9__|
  |      |         |      |
10|    11|       12|    13|
  |______|_________|______|
     14       15      16


The object is to draw a single line that crosses all of the 16 lines
in the figure once and only once.  The line may start inside or outside
the figure, and it may not cross itself.  I suppose the best way to 
post an answer is to indicate whether the solution starts inside or outside
the figure, and then list the lines as they are crossed as indicated in
the figure above.

-- 

"You see, Elvis can't read contracts.  All Elvis knows is, no Ferrari,
no more rides with the top down." --Sonny Crockett