How is your tism my brobots?
It's a big line
>>28430794
Did it on my phone with chubby fingers, but I think you can see, I noticed the inside circle at 9 o clock had one less door, so I started from the centre and went around clockwise expanding out.
Is this a positive result for autism or negative
>>28431037
4u
Original (4U)
>>28431221
Is forgetting pics pro or anti autism?
>>28430794
Pretty ez tBH
best I could do, sorry
>>28431275
You went through the door at 1 o clock twice
>>28431275
you missed a door at the top
I don't think it's doable
>>28431325
No, I went through the wall. The rules never mentioned the line couldn't go through walls
>>28431346
Fixed, thanks
>>28430794
That's my autism level.
>>28430794
>>28431037
>>28431221
>>28431231
>>28431243
>>28431275
>>28431280
>>28431325
>>28431346
>>28431347
>>28431387
>>28431325
>>28431346
>>28431347
>>28431387
>>28431503
It's impossible to have a connected line pass through everything exactly once. Troll pic.
t. Math major
Just start at the middle and count the number of times you can go in or out. It's odd, therefore you can never connect them.
>>28431575
B-but the picture says it's possible.
>>28431575
I'll take your word for it!
>>28431632
It says "it's tricky".
>>28431347
There's the trick!
>>28431632
>>28431678
Forgot to account for wall passing abilities since it wasn't strictly said it can or can't. Sorry anon
Once again because I'm really autistic.
The old "seven bridges" problem
Here is the solution
>>28432086
You missed one you fucking mong
>>28432165
*Number of odd vertices is not even
FTFY
>>28432932
I'm fairly sure it's 0 or 2
Because I left out H which has degree 9
Yet it still isn't eulerian
>>28433430
nvm you are correct
>>28430794
I feel like i've done something awful
there i did itt
Guys, did I pass?!!
>>28433430
>>28432932
I'm not very well-studied with regards to graphs, but the requrirement of 0/2 odd-degreed vertices makes sense.
You're trying to hit every edge, so if you have an odd-degreed vertex you can either start on the vertex and eventually leave, or start on the outside and end up on the vertex. You can't go "through" an odd-degreed vertex, i.e. start outside the vertex and end up leaving the vertex. Therefore, if you're trying to find a path through every edge, you would have to have no odd-degree vertices or two (one to start on and one to end on).
The puzzle has 3 vertices of odd degree. Even if you start on one vertex of odd degree and end on another, the third vertex is going to have an edge that you just can't include in your path.
Tl;dr yeah it's impossible
