Path searching: is it pure A*?

[karjalv]

Hi @bigsuperZZZX,

thanks for impressive work! I noticed that in your article you mentioned that for path searching you use A. The name of the file in the repository is dyn_a_star.cpp. What is that "dyn" meaning there? Is the path searching done by pure A, or does the name mean that it is "dynamic A" (same as D)? And if it is dynamic A*, where is the modification of arc costs done in the code?

Thanks in advance!

[bigsuperZZZX]

The "dynamic" means the start and the end grids of A* search are dynamically allocated in the memory pool. Nothing special.