Original Post
I am currently coding first time A* algorithm (and having some trouble with it), and I would really appreciate any advice concerning optimizations improvements or anything else about this topic - it seems awfully slow - I am using 2D map about 200x200 nodes and in screen fits about 20x20 nodes and for storing closed nodes list i''m using double linked list.