Congratulations to Jared Cox with a lightning fast time of 0.166 seconds and the lowest score. (The total of ten different routes). There were four entries in this challenge to find the shortest route. This just goes to show how important the algorithm is as the 2nd best took 2587 times as long to execute! You can view the source code for all four entries.
Despite my accidentally not publishing the link to Challenge 13 (it's there now) that starts today, one keen entrant Chris Greth has already submitted an entry to this challenge, so get yours in! Remember you can submit later entries if you discover a mistake or a way to improve on your previous entry.
- Link to Programming Challenge Thirteen Play Battleships
- Link to Programming Challenge Twelve Find the lowest cost route between ten points
Comments
No comments yet. Leave a Comment

