Re: A* Pathfinding is slow with my implementation

Use dynamic programming perhaps - record a table of best moves for each
state then you don't have to search the next time you need to choose a move.
This would work well for small numbers of states but large numbers of paths.

"Crirus" <[EMAIL PROTECTED]> wrote in message
news:[EMAIL PROTECTED]
> Hello
> I just implemented A* in a square grid map. It wirk on for paths
> shortest than 20-30 but for paths of 70 steps became very slow
>
> How can I speed up that? hints...
>
> Thanks,
>  Crirus
>