|
Re: New to AI Programming -
29-09-2006
Alright, not searching for diagonal paths (which I'm pretty sure I implemented wrong anyway) decreases the search time incredibly from before (from over 1 sec to ~30ms).
EDIT: Fixed diagonal searching, seems my H heuristic was completely off and was sending the A* search in every possible tile between the points. Still faster with H fixed.
|