FindPath gdwCurNodes gdwCurPathStep GetNextPath path_2_nodes path_check_equal path_directions path_get_h_cost path_get_node1 path_get_node2 path_get_path path_new_step path_next_node path_nodes path_parent_path path_pop_active_step path_push_active_step path_set_coords path_solid_pieces path_unusednodes pathxdir pathydir pnode_ptr pnode_tblptr pnode_vals

pnode_vals int pnode_vals[MAX_PATH_LENGTH] for reconstructing the path after the A* search is done. The longest possible path is actually 24 steps, even though we can fit 25 Definition at line 20 of file path.cpp.