Hey guys,

I really need help over here. I have a isometric map like this:

Example:

I need calc the better path (step by step), from 0,2 position -> to 2,1

One of this paths will be: 0,2(start) - 1,2 - 2,2 - 2,1(end)

My problem a question:

Anyone already do something like that? I start looking some implementation from A* algorithm to solve this , but I'm not completely sure it will work on C2.

The c2pathfing plugin can't help me on this =(

I already know the distance cost of each tile using some math ( |X-dX|+|Y-dY| = distance cost) :

I think i can find a logical solution , but I'm afraid of messing up the in C2 implementation.

Has anyone ever done something like this?

Sorry for the poor english.