A quick travelling salesman resources before I get some shut-eye in case anyone tries the Squirrels .NET application
Squirrels gathering nuts in turn comes out to one of the larger problems in computer science, that of the travelling salesman. We are looking for an optimal, or least moves route to complete some tour. Since the two problems are related, but aren't exactly identical I'll drop the following resource which happens to have the most up-to-date information I've seen. http://www.tsp.gatech.edu/
Rather than focusing enhancements towards larger spaces and making the application a more precise travelling salesman problem, I'm going to instead work on some game-like features that will make the application interesting from an interactive stand-point. I may also flex my C# interpreter a bit for ultra-quick testing of algorithms without having to constantly recompile.