(04)[207 199]O	(05)[208 199]O	(06)[209 199]O
(04)[207 198]O	*(05)[208 198]O	*(06)[209 198]O <<<<<|
(04)[207 197]O	(05)[208 197]O	(06)[209 197]O       |
                                                     |
                                                   start

Terms: (04) -----------Clearance values [207 199]--------X,Y Coordinates O ---------------open space The agent currently has a capability score of 5. When A* runs till 209 198, the surrounding 8 tiles are opened. including 208,199, On the next run, A* had chosen 208 198 as the next destination. * denotes the searched path. Okay, then I have a problem, when a star gets up to 208, 198 , it gets stuck because 208 199 and 208 197 are already visited. 207 199, 207 198, 207 197 don't have enough clearances for the algorithm to pick as candidates. So the pathfinding fails. My question is how do I resolve this embarrassing situation? I have been staring at it for a week already. What I want to achieve is that a star will choose 208 199 as the next tile. Thanks for any insights Jack [Edited by - lucky6969b on May 7, 2010 3:17:54 PM]

I put in a check to make sure that the previous hex (square in your case) was never chosen as an open node.

Quote: Original post by ID Merlin
I put in a check to make sure that the previous hex (square in your case) was never chosen as an open node.

You mean a breakpoint?