Hex-a-hop optimal solution finder 1.0

_____________where to startdldcdldcdldcdldcdldcdldcdldcdldcdldcdldcdldcdldcdldcLook at hex_a_hop.m using MATLAB. Octave, a free imitator of MATLAB, can also "work".Unless you are curious, there is no reason to look at any other .m files. If you ARE curious, I've done my best to make the code readable, so feel free to look at it. Due to the complex nature of the program and my less-than-perfect ability to make the code readable, you may still have some trouble!_____________my goaldldcdldcdldcdldcdldcdldcdldcdldcdldcdldcdldcdldcdldcI thought that using a computer to search for optimal solutions to the awesome open-source game called Hex-a-hop was a cool idea, so I wrote some code to do just that. The code worked great on half of the levels, and their optimal solutions are provided in the code. However, the brute force strategy I used leads to solution times that grow exponentially as levels get more complex. Many levels run in seconds, while some could take millennia. I've done my best to speed things up, but, after trying to run all levels, many reached the time limit before completing. Since I only want algorithms that guarantee that the returned solution is optimal, there is not much I can do to fix this.

Requirements:	No special requirements
Platforms:	Matlab
Keyword:	Brute,  Exponentially,  Force,  Leads,  Solution,  Strategy,  Times,  Worked,  Wrote
Users rating:	0/10