SoftwareProjektSolver

From Wurst-Wasser.net
Jump to navigation Jump to search
The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

To solve "Weitblick" (GC1259N) I programmed this:


What to do

SolverGC1259N.gif

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.

The Solution

A perl program, that uses brute force and finds the solution after about 207,000,000 tries. This takes some seconds on my iMac but is eventually much faster than trying this by hand...

File:Heiko20081110solver.zip

System Requirements

  • Perl