|
|
|
|
|
|
by munificent
2442 days ago
|
|
|
> A* doesn't work because the heuristic becomes pretty useless when you have moves that are very "cheap" I don't see where you have cheap moves. If your move costs are unit for straight lines, slightly longer for diagonal (i.e. probably close to sqrt(2)), and much longer for obstacle, then A* will work fine. The lower bound is just the usual Cartesian or Manhattan (depending on your diagonal cost) distance. |
|
|