Pathfinding Peril - BCS 2014

2687ad35ad8b93df96c5521a86c7101c?s=47 chrismdp
January 07, 2015

Pathfinding Peril - BCS 2014

Finding the shortest path through a connected graph is a complex problem, and one which has a number of very useful applications. Thankfully there are some efficient algorithms out there which solve it well. The first part of the session will take you through some basic theory and how the A-Star algorithm works.
In the second part, you will then put your newly-found pathfinding skills to the test! We'll run a tournament for the remaining hour and a bit, using a robot tournament engine. You'll be able to write a robot in any language, which will be one of two characters in a maze, and the idea is to find the exit as soon as possible without being eaten by the minotaur that roams randomly around it.

2687ad35ad8b93df96c5521a86c7101c?s=128

chrismdp

January 07, 2015
Tweet