Re: Need A* Help
Posted: Mon May 26, 2014 7:41 pm
Is there more stress involved when using diagonal pathfinding as opposed to (as you call it-) orthogonal pathfinding ?
In a test i have a 32*32 tile set using STI, i convert the 2D STI tiles to a format the astar uses, but ive noticed that if i ran the path = pathfind update every 1s between to locations on the map(very far away, lots of solid tiles in the way) I experience some frame drops, if i run it once its fine and if constant then id be better off doing a while(true) end loop if i wanted that much freeze.
In a test i have a 32*32 tile set using STI, i convert the 2D STI tiles to a format the astar uses, but ive noticed that if i ran the path = pathfind update every 1s between to locations on the map(very far away, lots of solid tiles in the way) I experience some frame drops, if i run it once its fine and if constant then id be better off doing a while(true) end loop if i wanted that much freeze.