Report, edit, etc...Posted by Freedawk on 2006-11-14 at 21:49:41
What I'm asking here is incredibly hard, althought is seems easy at first. What you need to do is get through all those 16 doors (identified here as a line), starting from the inside or the outside of the house, but NEVER get through the same door twice.
I forgot to specify you need to draw without removing your pencil from the sheet as soon as you start to write.
(I can't solve it myself. I'm trying to prove it is impossible to my friend, but he claims it is possible)
EDIT: 16 DOORS! Sorry guys lol.
Report, edit, etc...Posted by Lord_Agamemnon(MM) on 2006-11-14 at 22:00:37
I'm pretty sure it's possible if you consider the graph theory of it. So tell your friend he's wrong. Darned if I know how to solve it, though...Sorry 
Report, edit, etc...Posted by Voyager7456(MM) on 2006-11-14 at 22:04:44
Do you have to stay inside the house?
Report, edit, etc...Posted by Freedawk on 2006-11-14 at 22:05:23
Go through every door once. No, you don't stay inside the whole time.
But it is 17 doors, and compared to 5 spaces...It seems impossible.
I might throw in a few minerals for the winner.
EDIT: NO ERASING PRE DRAWN LINES
But it is 17 doors, and compared to 5 spaces...It seems impossible.
I might throw in a few minerals for the winner.
EDIT: NO ERASING PRE DRAWN LINES
Report, edit, etc...Posted by Doodle77(MM) on 2006-11-14 at 22:09:31
Report, edit, etc...Posted by Freedawk on 2006-11-14 at 22:12:27
Sorry guys, it was 16, not 17 doors.
Report, edit, etc...Posted by Doodle77(MM) on 2006-11-14 at 22:18:45
And yes, it is impossible.
http://en.wikipedia.org/wiki/Eulerian_path
http://en.wikipedia.org/wiki/Eulerian_path
Report, edit, etc...Posted by Mini Moose 2707 on 2006-11-14 at 22:34:04
Oops, I didn't solve it. 
Report, edit, etc...Posted by HorroR on 2006-11-14 at 22:36:13
Nah, there's something wrong with that one. Bottom middle.
Report, edit, etc...Posted by Mini Moose 2707 on 2006-11-14 at 22:37:44
Oh yeah, I drove through a wall there.
Report, edit, etc...Posted by DT_Battlekruser on 2006-11-14 at 22:37:52
It's impossible without jumping through walls like Moose did.
But can you prove it?
But can you prove it?
Report, edit, etc...Posted by HorroR on 2006-11-14 at 22:39:40
QUOTE(Mini Moose 2707 @ Nov 14 2006, 10:37 PM)
Oh yeah, I drove through a wall there.
[right][snapback]589458[/snapback][/right]
[right][snapback]589458[/snapback][/right]
It's alright Moose, you just smashed it. You have to pay for repairs, though.
Report, edit, etc...Posted by Deathawk on 2006-11-14 at 22:43:22
QUOTE(DT_Battlekruser @ Nov 14 2006, 11:37 PM)
It's impossible without jumping through walls like Moose did.
But can you prove it?
[right][snapback]589459[/snapback][/right]
But can you prove it?
[right][snapback]589459[/snapback][/right]
Depends on how much you value Doodle77's word
Report, edit, etc...Posted by DT_Battlekruser on 2006-11-14 at 23:31:21
You can prove, in a sentence, that the puzzle is impossible.
Report, edit, etc...Posted by Freedawk on 2006-11-15 at 07:40:53
I'm deeming this impossible, but keep this topic open for anyone to prove this is possible.
Report, edit, etc...Posted by BeeR_KeG on 2006-11-15 at 18:24:36
It is possible to mathematically determine whether or not it is possible, but I'm not going to work on a matrix that big.
Report, edit, etc...Posted by Zeratul_101 on 2006-11-15 at 19:15:03
using the eularian path, thing, you can already determine its impossible, without doing any math. just counting. you'll have that the bottom middle has an odd number of 'path,s' making it impossible.
Report, edit, etc...Posted by MillenniumArmy on 2006-11-15 at 20:38:30
Does your friend know how to solve it?
Report, edit, etc...Posted by DT_Battlekruser on 2006-11-15 at 20:54:11
QUOTE(BeeR_KeG @ Nov 15 2006, 03:24 PM)
It is possible to mathematically determine whether or not it is possible, but I'm not going to work on a matrix that big.
[right][snapback]589733[/snapback][/right]
[right][snapback]589733[/snapback][/right]
The simple way to disprove it is this:
If you can travel through each door only once, then the ONLY possible way to travel through each door of a room with an odd number of doors is for the path which goes through the odd final door to end within the room. With one continuous path, the maximum number of times this can happen, and therefore the maximum number of odd-number-door rooms you can have, is two.
The given puzzle has three rooms with an odd number of doors (5), therefore the puzzle is impossible. Q.E.D.
Report, edit, etc...Posted by Oo.Insane.oO on 2006-11-15 at 21:02:06
With a little home improvement ive made it possible
Report, edit, etc...Posted by BeeR_KeG on 2006-11-15 at 21:13:00
You went trough the same door twice.
Report, edit, etc...Posted by Zeratul_101 on 2006-11-15 at 21:15:09
hence 'a little home improvement' 
Report, edit, etc...Posted by Oo.Insane.oO on 2006-11-15 at 21:30:36
QUOTE(BeeR_KeG @ Nov 15 2006, 09:13 PM)
You went trough the same door twice.
[right][snapback]589848[/snapback][/right]
[right][snapback]589848[/snapback][/right]
No I didnt I added 2 doors
Report, edit, etc...Posted by BeeR_KeG on 2006-11-15 at 21:44:40
Then there is no logic behind this because no where in the rules did it say that I couldn't go THROUGH walls.
Report, edit, etc...Posted by Freedawk on 2006-11-15 at 22:52:52
IT says doors, not walls.
IT should still be impossible...
IT should still be impossible...