CHANGELOG: 1.1, added some pre-calculated fail situations, drastically decreasing the amount of recursion used. ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Here's the reasoning behind the title: My solution is based around finding the longest possible path from the 1 to the 64 using a modified a* algorithm. It doesn't sort the paths from longest to shortest, it just tests whether it's on 64, and if it is, it will test to see if there's any open spot. If not, it will ignore that solution. I was also going to make something to create a random new puzzle for testing, but I didn't feel like making it for some reason. I might add it later.
