All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars
 perplexus dot info

 Bug in the Problem? (Posted on 2005-04-22)
Twelve bugs – two of six different species – want to find their respective mates. Your job is to connect A to a, B to b, …, and so forth using an unbroken path between each bug pair. Your lines must travel through the center of each square in the array, and you can only travel up, down, left and right (not diagonally).

Because the bugs leave behind poison trails, no path can cross another, and no path can cross itself. When you are finished, every square must have been traversed once and only once.

``` _ _ _ _ _ _ _
|A|_|B|_|_|_|C|
|_|_|_|_|d|_|_|
|_|_|D|_|_|_|_|
|_|_|_|E|_|_|e|
|_|_|_|F|_|_|_|
|_|_|_|_|_|_|_|
|a|_|_|_|b|c|_|
|f|_|_|_|_|_|_|```

Prove whether or not there is a solution.

If you think there is a bug in the problem, can you move EXACTLY one bug EXACTLY one square from its original position (not diagonally) and find a solution? Would it be unique?

The bulk of this problem was created by Clifford Pickover

 See The Solution Submitted by nikki Rating: 3.2000 (5 votes)

 Subject Author Date re: Move 1 bug (partial spoiler) Dej Mar 2008-10-01 00:34:57 No Subject Bruno 2005-04-29 05:40:35 Move 1 bug Bruno 2005-04-29 05:38:53 Solution Jonathan Chang 2005-04-27 15:20:46 Trying to proof Hugo 2005-04-22 16:11:19 Another route Mark 2005-04-22 16:09:29 Partial spoiler Erik O. 2005-04-22 15:33:07

 Search: Search body:
Forums (0)
Random Problem
Site Statistics
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox: