This one is solvable. Here's one possible solution:
What makes this one different from the 'real' Konigsberg problem?
(Hint: How many bridges lead to each piece of land? Why is having
an odd number of bridges leading to a single piece of land problematic?)
to the Bridges of Konigsberg to Euler's Solution to the Problem: the
Degree of a Vertex