Begin wherever you want and draw one line through all of the doors, but you cannot go through the same door twice

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!

Attached: autism test.png (1143x1133, 1.85M)

Other urls found in this thread:

discord
en.wikipedia.org/wiki/Cool_S
en.wikipedia.org/wiki/Seven_Bridges_of_Königsberg
en.wikipedia.org/wiki/Eulerian_path
twitter.com/SFWRedditVideos

ez

Attached: victory for autism.png (1143x1133, 1.96M)

Attached: 1411542931798.jpg (950x1381, 307K)

discord
=|+|=|1029|=|+|=
.gg/Bsyufq6

fpbp

I drawed octopus

Attached: received_1116792158500366.jpg (1143x1133, 234K)

u woke af user, u aight

haha, you erased one of the doors, nice try xD

en.wikipedia.org/wiki/Cool_S

Attached: Screenshot_9 - Copy.png (681x673, 693K)

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

Attached: im smart.png (682x683, 873K)

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

Attached: 20190322_172006.jpg (1024x1014, 718K)

its a mad dino

Attached: mad dino.png (1523x595, 92K)

Ok retard btw how do those crayons taste?

hahaaa, no ur rong

Can I have my autism now?

Attached: 545ACAE4-2B2B-4997-B197-C4C9C8C411DA.jpg (1024x1015, 494K)

Attached: brainletgrayons.png (558x614, 32K)

Attached: 54A8B0C7-799F-420D-B805-DC822264BFF6.jpg (1024x1015, 505K)

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...

Attached: _20190323_004008.jpg (3526x1436, 613K)

There is no Eulerian path in the graph, since there are 8 nodes of odd degree.

en.wikipedia.org/wiki/Seven_Bridges_of_Königsberg

en.wikipedia.org/wiki/Eulerian_path

Who has autism now?

Attached: C33AE0A2-3391-44B9-8A42-8970FC9856F1.jpg (1024x1015, 486K)

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.

Attached: degree 7 node.png (1152x1133, 1.91M)

Attached: delete.jpg (249x247, 27K)

Skipped a door.

Attached: IYG5m.jpg (2143x994, 399K)

Attached: test-.png (781x774, 1.21M)

Attached: test-.png (809x802, 1.24M)

i win...

Attached: 1373581124331.jpg (1143x1133, 657K)

You missed one

Attached: test-.png (541x536, 605K)

H̴͆̽̀̊a̧͈͙̥i͈̇ͨ̉̇͐̓́l͎̙̮̯̙̗̏̾́͛̌ ̯̹̺̓͗̐͒ͩͤS̳̣͖̗͑̐̎͑͗̂̌a̶̗̫̦t̩͇̖̪͓a̵̝ͧͦ̾ͪn̓̇͊͛̏͆̒͞

Attached: Hail.jpg (1914x1780, 704K)

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.
>

Attached: 7361771876.jpg (2308x1616, 153K)

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.

Attached: brakebill.png (1920x1080, 624K)

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.