To solve "Weitblick" (GC1259N) I programmed this.
What to do
The goal is to reach the gray border with the last step (and finding the route with the least hops). Start with 3 in the middle.
A perl program, that uses brute force and find the solution after abou 207,000,000 tries. This takes some seconds on my iMac but is eventually pretty fast especially if you try this by hand..