Do you know this puzzle?

[2350]

There is a path in the form of a square & each corner is also connected by the path. The task is to walk on all paths with out walking on the same path twice. It's ok to cross where you have already walked. I'm after the answer

Chris

[Hammond Egg]

It's not possible.

There are four places - the four corners - where three paths meet. In order for a network to be navigable without covering the same path twice, there should be a maximum of two places where an odd number of paths meet in which you would begin your journey at one and finish it at the other. For any other such place, you can arrive at and leave it once, but that leaves only one path approaching it; so you can arrive at it a third time but not leave it without covering a path you have already covered.

I hope this is clear.

[juliefer]

If this is a trick question, it's possible to walk on all the paths without going over the same path more than once if you can walk round from one corner to another outside the square itself (ie not on one of the paths). Hard to explain without a diagram but you'd only need to do this once during the walk.