mirror of https://github.com/cabaletta/baritone
76 lines
2.4 KiB
Java
76 lines
2.4 KiB
Java
|
/*
|
||
|
* This file is part of Baritone.
|
||
|
*
|
||
|
* Baritone is free software: you can redistribute it and/or modify
|
||
|
* it under the terms of the GNU Lesser General Public License as published by
|
||
|
* the Free Software Foundation, either version 3 of the License, or
|
||
|
* (at your option) any later version.
|
||
|
*
|
||
|
* Baritone is distributed in the hope that it will be useful,
|
||
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||
|
* GNU Lesser General Public License for more details.
|
||
|
*
|
||
|
* You should have received a copy of the GNU Lesser General Public License
|
||
|
* along with Baritone. If not, see <https://www.gnu.org/licenses/>.
|
||
|
*/
|
||
|
|
||
|
package baritone.api.pathing.goals;
|
||
|
|
||
|
import net.minecraft.util.EnumFacing;
|
||
|
import net.minecraft.util.math.BlockPos;
|
||
|
|
||
|
/**
|
||
|
* Dig a tunnel in a certain direction, but if you have to deviate from the path, go back to where you started
|
||
|
*/
|
||
|
public class GoalStrictDirection implements Goal {
|
||
|
public final int x;
|
||
|
public final int y;
|
||
|
public final int z;
|
||
|
public final int dx;
|
||
|
public final int dz;
|
||
|
|
||
|
public GoalStrictDirection(BlockPos origin, EnumFacing direction) {
|
||
|
x = origin.getX();
|
||
|
y = origin.getY();
|
||
|
z = origin.getZ();
|
||
|
dx = direction.getXOffset();
|
||
|
dz = direction.getZOffset();
|
||
|
if (dx == 0 && dz == 0) {
|
||
|
throw new IllegalArgumentException(direction + "");
|
||
|
}
|
||
|
}
|
||
|
|
||
|
@Override
|
||
|
public boolean isInGoal(int x, int y, int z) {
|
||
|
return false;
|
||
|
}
|
||
|
|
||
|
@Override
|
||
|
public double heuristic(int x, int y, int z) {
|
||
|
int distanceFromStartInDesiredDirection = (x - this.x) * dx + (z - this.z) * dz;
|
||
|
|
||
|
int distanceFromStartInIncorrectDirection = Math.abs((x - this.x) * dz) + Math.abs((z - this.z) * dx);
|
||
|
|
||
|
int verticalDistanceFromStart = Math.abs(y - this.y);
|
||
|
|
||
|
// we want heuristic to decrease as desiredDirection increases
|
||
|
double heuristic = -distanceFromStartInDesiredDirection * 100;
|
||
|
|
||
|
heuristic += distanceFromStartInIncorrectDirection * 1000;
|
||
|
heuristic += verticalDistanceFromStart * 1000;
|
||
|
return heuristic;
|
||
|
}
|
||
|
|
||
|
@Override
|
||
|
public String toString() {
|
||
|
return "GoalStrictDirection{" +
|
||
|
"x=" + x +
|
||
|
", y=" + y +
|
||
|
", z=" + z +
|
||
|
", dx=" + dx +
|
||
|
", dz=" + dz +
|
||
|
"}";
|
||
|
}
|
||
|
}
|