Begin wherever you want and draw one line through all of the doors, but you cannot go through the same door twice.
Hard, but possible!
Begin wherever you want and draw one line through all of the doors, but you cannot go through the same door twice
Other urls found in this thread:
discord
en.wikipedia.org
en.wikipedia.org
en.wikipedia.org
twitter.com
ez
discord
=|+|=|1029|=|+|=
.gg/Bsyufq6
fpbp
I drawed octopus
u woke af user, u aight
haha, you erased one of the doors, nice try xD
Wich door?
The middle one on top.
Fair enough, I used a different copy from when this was posted last year. Didn't notice it was different
the rules said it didn't have to be connected
Dumb nigger one line the hell???
Nigga you can't erase what wasn't there
He didn't erase a door he added a wall
It's 1 line through each door, I did what it asked
>trough
>a long, narrow open container for animals to eat or drink out of.
through*
Actual retard spotted
I think you just need to expand your brain think what the rules ask and think outside the box
Ha, i beat your stupid little game
its a mad dino
Ok retard btw how do those crayons taste?
hahaaa, no ur rong
Can I have my autism now?
fag
More than two dots are linked to an odd number of paths therefore, according to a simple property of graph theory, it's not possible...
There is no Eulerian path in the graph, since there are 8 nodes of odd degree.
Who has autism now?
WINNAR WINNAR
>30 replies and no mention of Eulerian paths
Eulerian paths only exist if all nodes have even degree. In this subgraph of the graph of doors pictured here, the red node has degree 7. Therefore no solution exists.
Skipped a door.
i win...
You missed one
H̴͆̽̀̊a̧͈͙̥i͈̇ͨ̉̇͐̓́l͎̙̮̯̙̗̏̾́͛̌ ̯̹̺̓͗̐͒ͩͤS̳̣͖̗͑̐̎͑͗̂̌a̶̗̫̦t̩͇̖̪͓a̵̝ͧͦ̾ͪn̓̇͊͛̏͆̒͞
The definition of a line begs to differ
impossible...
There is one line through every door. I'm with this nigga.
A better wording would have been:
>A single line which goes through every the door.
>
You faggots realize it's not possible, right?
It's not possible. Think about the drawing of the rooms as a graph, where every room is a point and every doorway is a vertex between points.
You're asking Yea Forums to find an eulerian cycle on a graph that isn't eulerian. By definition, a graph is considered eulerian if the graph is both connected and has a closed trail (a walk with no repeated edges) containing all edges of the graph.
In order for there to be an eulerian cycle, there can only be a maximum of two vertices with an odd number of edges (or, in our case, doorways).
The reason that no user can draw a line to fit the conditions is because three rooms have five doors. If two rooms had five doors, it'd be fine - you can make this work by making the number of doors within one of these rooms an even number.
You got me OP, I'm the autist because I had to explain it to you retards.
You sir have won the autism test. You win 1 autism
Didn't say it had to be a Eulerian path, just said it had to go through all the doors.
You're retarded
THIS user WINS!!!
Yeah, I dunno the math, but logically it's because you have 1 entrance (odd) and no exit.
So either the path must split, there needs to be an extra door (or the question is lying and you can't finish the route).
It's a good autism test. First time I ran into it I spent a LONG time fucking with it.
Since then I've actually been diagnosed.
To this day, it still bothers me that you can ask a question like this with no answer.