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

path_check_equal() int path_check_equal ( PATHNODE *  pPath, int  dx, int  dy  ) return 2 if pPath is horizontally/vertically aligned with (dx,dy), else 3 This approximates that diagonal movement on a square grid should have a cost of sqrt(2). That's approximately 1.5, so they multiply all step costs by 2, except diagonal steps which are times 3 Definition at line 117 of file path.cpp.