hey folks, ive been doing studies latley on the A-star algorithm to find the shortest path
,its very effective though sometimes this shortest path would be full of turns.
this is somthing i want to get rid of,, turns,, cuz it makes the movement a little sick..
how do i do this? well i read somewhere that you should add a direction change cost penalty.
some text book also mentioned that the function would be somthing like this >
ADDED COST = D * NUMBER OF TURNS
where D is the cost of moving from a square to another (the turns are 45 degrees so if you want to turn 90 the num will be 2)
unfortunately in many cases this formula seems to fail (you can try it with some maps n see what i mean)
someone have read about a WORKING solution for path smoothing
?? help in need