[net.puzzle] LOOKS SIMPLE made clearer

mort@ihuxn.UUCP (Having trouble.) (12/04/83)

This is to clarify the directions of an earlier puzzle.

Here is the board:

       1               2             3
--------------------------------------------
!             !               !            !
! 4           ! 5             ! 6          ! 7
!             !               !            !
!             !               !            !
--------------------------------------------
!       8         9   !   10         11    !
!                     !                    !
! 12                  ! 13                 ! 14
!                     !                    !
--------------------------------------------
          15                      16

There are 16 segments, each of them numbered.  The objective is to
cross each segment once and only once with a continuous line.  Here are
the rules and restrictions:

     You may start drawing the line anyhere EXCEPT on the intersection of
          two or more lines or on any line.  In other words, in a blank space.

     The line must be continuous, i.e. you cannot "jump" over a line.

     The line must never cross itself.

     It may start and end inside OR outside of the board, but it must cross
          all of the 16 segments, with the word "cross" stressed.  Touching
          the line and "bouncing off" is not permitted.

Here is a sample board that is simpler than the above, completed:

             ****************
     ------------------------------
S    !       *      !       *     !
*****!********      !       ******!*****
     !         *****!******       !    *
     ---------------------F--------    *
     !         *                  !    *
  ***!**********    **************!*****
  *  !              *             !
  *  ------------------------------
  *******************

I have not found a solution to the top puzzle.  I may be overlooking
something.  I think it may be impossible due to the number of segments
(even/odd) and their placement.  

Here is another board that I have solved:

###############################
#       #                     #
#       #                     #
#########################     #
#       #               #     #
#       #               #     #
#       #######################
#                       #     #
#                       #     #
###############################

And another which I can't:

+++++++++++++++++++++++++++++++
+      +               +      +
+      +               +      +
++++++++               ++++++++
+                             +
+                             +
+                             +
++++++++               ++++++++
+      +               +      +
+      +               +      +
+++++++++++++++++++++++++++++++

If you have any you'd like to try on me, I'm all ears.


-- 

Jonathan Dubman - care of:

		Mort Dubman		AT&T Bell Laboratories
		ihnp4!ihuxn!mort	Naperville, IL.