0xf8/baritone
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Actually use Y and Z bounds for Y and Z

Browse Source
This commit is contained in:
ZacSharp 2020-09-20 22:20:24 +02:00
parent b20e095683
commit 85cc86346c
No known key found for this signature in database
GPG Key ID: 9453647B005083A3
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
src/api/java/baritone/api/pathing/goals/GoalRunAway.java
View File

@ -103,8 +103,8 @@ public class GoalRunAway implements Goal {
HashSet<Double> maybeAlwaysInside = new HashSet<>(); HashSet<Double> maybeAlwaysInside = new HashSet<>();
HashSet<Double> sometimesOutside = new HashSet<>(); HashSet<Double> sometimesOutside = new HashSet<>();
for (int x = minX; x <= maxX; x++) { for (int x = minX; x <= maxX; x++) {
for (int y = minX; y <= maxX; y++) { for (int y = minY; y <= maxY; y++) {
for (int z = minX; z <= maxX; z++) { for (int z = minZ; z <= maxZ; z++) {
double h = heuristic(x, y, z); double h = heuristic(x, y, z);
if (!sometimesOutside.contains(h) && isInGoal(x, y, z)) { if (!sometimesOutside.contains(h) && isInGoal(x, y, z)) {
maybeAlwaysInside.add(h); maybeAlwaysInside.add(h);