This week we will continue our Halloween theme with a trick or treater named Eddie who wants to maximize the efficiency of his rounds. Above is a map of Eddie's neighborhood: each dot represents a house and Eddie wants to hit all of them without having to walk the same road more than once. Well, Eddie can hope for that, but it's not going to happen. He will have to walk one road twice but he can still start at home and end at home without passing any house more than once. Here are some formulas to calculate the distance between the houses.
Can you find the optimal path for Eddie to take? Remember Eddie must start at Home and end at Home. __Send the path and the total distance in feet that Eddie traveled __to GeekDad Puzzle Central for a chance to win a $50.00 ThinkGeek gift certificate.