Oops!
My profuse apologies, but apparently there is actually no solution for the visual riddle below. It was told to me in such a way that there was a solution, but I guess the actual riddle is to prove mathematically that there is NOT a solution to this riddle.
So. Can you prove it? :)
posted by Timothy @ 9:03 AM
4 Comments:
All that wasted time & frustration. Argh! Your next post better be VERY good, Tim. VERY GOOD.
:D
Coulda sworn I solved it. Thanks for ruining it for me. :)
And hey, thanks for maintaining your blog, brother. Always nice to browse your posts.
I don't think I can mathematically prove the impossibility. Well maybe I can, but it won't happen anytime soon.
Thanks. Ok. Consider each point that any bridge connects to as a node. In this diagram, there are four nodes (each shore, and the two islands). Every node must have an even number of connecting sides. If there is a node with an odd number, there must be only TWO nodes that have an odd number of connecting sides. One would be the starting node, and the other, the ending.
As all of these nodes have three connecting sides, it would be impossible.
There. Glad we have that out of the way.
Post a Comment
<< Home