Treasure hunt problem: You must choose the sortest path to go from an initial state to the treasure. In the map there is a field full of landmines and you cant pass between them, but only around them.
input format (txt): Coordinates. first row=initial state || last row=treasure
4 62
125 95
156
5 63
124 100
23 108
50 99
108 107
52 54
115 107
102 86
100 83
103 500
91 73
95 79
43 57
38 24
6 53
120 48
8 72
55 32
22 78
78 200