From: obneq Date: Sat, 25 Apr 2015 13:16:44 +0000 (+0200) Subject: Fix pathfinder to produce more useful paths X-Git-Tag: 0.4.13~314 X-Git-Url: https://git.librecmc.org/?a=commitdiff_plain;h=9af7f38e3f077ec42fcc3086c82d2676c53c84a6;p=oweals%2Fminetest.git Fix pathfinder to produce more useful paths - Fix unintended negation of condition - Remove line_of_sight 'optimization' --- diff --git a/src/pathfinder.cpp b/src/pathfinder.cpp index d39bdab3a..8eb52bfd1 100644 --- a/src/pathfinder.cpp +++ b/src/pathfinder.cpp @@ -310,27 +310,16 @@ std::vector pathfinder::get_Path(ServerEnvironment* env, print_path(path); #endif - //optimize path - std::vector optimized_path; - - std::vector::iterator startpos = path.begin(); - optimized_path.push_back(source); - + //finalize path + std::vector full_path; for (std::vector::iterator i = path.begin(); i != path.end(); i++) { - if (!m_env->line_of_sight( - tov3f(getIndexElement(*startpos).pos), - tov3f(getIndexElement(*i).pos))) { - optimized_path.push_back(getIndexElement(*(i-1)).pos); - startpos = (i-1); - } + full_path.push_back(getIndexElement(*i).pos); } - optimized_path.push_back(destination); - #ifdef PATHFINDER_DEBUG - std::cout << "Optimized path:" << std::endl; - print_path(optimized_path); + std::cout << "full path:" << std::endl; + print_path(full_path); #endif #ifdef PATHFINDER_CALC_TIME timespec ts2; @@ -344,7 +333,7 @@ std::vector pathfinder::get_Path(ServerEnvironment* env, std::cout << "Calculating path took: " << (ts2.tv_sec - ts.tv_sec) << "s " << ms << "ms " << us << "us " << ns << "ns " << std::endl; #endif - return optimized_path; + return full_path; } else { #ifdef PATHFINDER_DEBUG @@ -532,7 +521,7 @@ path_cost pathfinder::calc_cost(v3s16 pos,v3s16 dir) { if ((testpos.Y >= m_limits.Y.min) && (node_at_pos.param0 != CONTENT_IGNORE) && (node_at_pos.param0 != CONTENT_AIR)) { - if (((pos2.Y - testpos.Y)*-1) <= m_maxdrop) { + if ((pos2.Y - testpos.Y - 1) <= m_maxdrop) { retval.valid = true; retval.value = 2; //difference of y-pos +1 (target node is ABOVE solid node)