SE701:Pathfinding
Jump to navigation
Jump to search
First Part: Pathfinding using A* algorithm
The basic idea is to find the shortest path from the start point to the target point using A* algorithm.
For more details please refer to: http://www.gamedev.net/reference/articles/article2003.asp
Should Demonstrate:
- anonymous functions
- macros
- the FORMAT function
- arbitrary-precision integers
- list processing
- condition restarts
Second Part: Simple draw picture program
This program will read a .txt file and draw the shapes described in the file.
For more details please refer to the question 3 of CS372 Assignment1.
Should Demonstrate: