Researched into path finding algorithm on map in the field of 2D game. Expounded A* algorithm and D* algorithm and simulated two path-search algorithms on the Blitz Basic 2D game development platform. Experimental results indicate that A* algorithm is suitable for searching path on static game map, D* algorithm is very quickly and effectively when searching path in dynamic game map environment, and as the number of nodes increasing, the performance of D* is better than A*.