Extremely Tough Brain Teaser

[LikeLinus]

Here's my try.

What am I missing?

http://pics.bbzzdd.com/users/fireal/MyTry.jpg

Green is start
Black is finish

 

[dullard]

Originally posted by: LikeLinus
What am I missing?

http://pics.bbzzdd.com/users/fireal/MyTry.jpg

Middle gate, vertical, in top row.

 

[chuckywang]

This is just a graph theory problem.

 

[LikeLinus]

gotcha, i should have looked better!

 

[yosuke188]

Originally posted by: dullard

Originally posted by: LikeLinus
What am I missing?

http://pics.bbzzdd.com/users/fireal/MyTry.jpg

Middle gate, vertical, in top row.

Why are people still trying to solve this?

I thought it was understood that there is no solution. Why are people still trying to do the impossible

 

[LikeLinus]

Originally posted by: yosuke188

Originally posted by: dullard

Originally posted by: LikeLinus
What am I missing?

http://pics.bbzzdd.com/users/fireal/MyTry.jpg

Middle gate, vertical, in top row.

Why are people still trying to solve this?

I thought it was understood that there is no solution. Why are people still trying to do the impossible

Because I'm at home sick and it's something to do?

 

[chuckywang]

Alright, it's time to end this thread once and for all.

The problem is to basically find an Eulerian path in this graph (on the bottom)..

A necessary condition for an Eulerian path to exist is that all vertices must have an even degree, or all vertices but 2 vertices must have an even degree. Note vertex 6 has a degree of 9, vertex 1 has a degree of 5, vertex 2 has a degree of 5, and vertex 4 has a degree of 5.

Therefore, four vertices have an odd degree, so the condition is violated, and no Eulerian path exists. Therefore, there is no path that goes through all the "gates".

 

[chuckywang]

Did I kill this thread?