Hello Everyone, I was trying to solve couple of fun problems. Many of you must have heard about the famous The Seven Bridges Of Konigsberg and how Euler solved the puzzle. You can do a quick google... Here is a diagram if you want it... http://www.contracosta.cc.ca.us/math/BridgeGraph.GIF [Broken] One of the question is: 1) Can you walk from say point B to point A crossing each bridge exactly once. Answer - This is an Euler path problem. So question can be thought of as: Is there an Euler path from point B to A. Well, B has 5 degrees and A has 3 degrees so start and end points are odd degree but the other points (namely, C and D) are odd . This violates Euler's path definition. So it is not possible. Is my reasoning correct? 2) If I am moving from C to B and I must cross each bridge atleast once. what is the minimum number of times I have to cross a bridge? Answer - Is tracing with the pencil the best way to do this problem. I got 8. Please respond as soon as possible. Thank You for your time.