The Hogwarts Bridge Problem
Problem Statement:
You are at Hogwarts and you need to find a way to get to each part of town by crossing each bridge once. Would this be possible?
You are at Hogwarts and you need to find a way to get to each part of town by crossing each bridge once. Would this be possible?
My Process:
I basically tried every combination that I could muster. But I couldn't figure out EXACTLY why none of these paths work. So I decided to look online and see what people were saying about the problem. So I came up with this explanation, in my own words. The picture to the right shows the outline for the bridges. So the points labeled with red letters are called vertecies. These are our starting points. The points labeled with blue are called arcs, points that connect to a vertex. The number of arcs connecting to a vertex is the number of degrees. (A vertex with 3 arcs connecting to it, is 3 degrees.) The reason this problem is unsolvable is there are more than 2 points with an odd degree number. But to make this problem solvable would be to remove the "e" bridge. This would make "A" 4 degrees. And "D" 2 degrees. Another example, would be a square. Each point on a square would only be 2 degrees. That's why it could work. Solution: It is impossible to cross each bridge each time. Evaluation: I thought my effort was fairly good 6/10 I didn't really like the problem, it was kind of dull 3/10 |