alandotic / a-star Goto Github PK

This algorithm simply does not work - it is only okay for some rare cases when 
you are going down and right. It's not a real a*.

Please don't use it until it's been rewritten.

Hello,

Is there any other License option besides GPL? I'm not able to use this on my 
software as it will be commercially sold in the first year, only then I'll make 
the source avaliable.

Please, do it.

What steps will reproduce the problem?
1. Run example code in java
2. view map
3. only goes to bottom right

Output as expected but how do you change the destination node??
thanks

I'm attaching patch that fixes invalid free in pathplan2.

When calculating the cost of the path so far for a node (G) the following
expression is used:
tmap[x+(y)*w] + cost*0.5;

I don't quite understand what the values in the map are supposed to be. I
understand that we use 0 for non-acessible locations in the original map.
On the other hand, we use 0 in the tmap to avoid going backwards in our
search for a path.

From what I understood from the code, tmap would be the cost of crossing a
node from one side to the other. But in that case, shouldn't the expression
for G be something like
tmap[x+(y)*w]*0.5 + cost*0.5?

If your work was based on any type of online documentation I will gladly
read it.

Best Regards