You are hereA * Path Finding
A * Path Finding
This is an assignment taken from my AI course. It shows a basic AStar pathfinding implementation over a square grid. There are some options that can be tweaked, e.g. choice of several maps, choice of heuristic function used, etc.
The code is based off a framework provided by Steve Rabin, with the actual AStar implementation done entirely by me. Recommended file to look at for code sample is movement.cpp.
*EDIT: Unfortunately I've been told that other students had been directly lifting my code for the same course I took, so I've been asked to take down the source code as of 30th November, 2011. Apologies for any inconvenience caused! The upload now points to a compiled binary, no source I'm afraid :/*
DirectXSDK installed, preferably latest version (June 2010 as of this writing).