From 380f21bb386dd77c80c32e18a95cdd79d6b8ac87 Mon Sep 17 00:00:00 2001 From: Brady Date: Thu, 13 Sep 2018 14:48:23 -0500 Subject: [PATCH] Remove pythagoreanMetric setting --- src/main/java/baritone/Settings.java | 6 ------ src/main/java/baritone/pathing/goals/GoalXZ.java | 3 --- 2 files changed, 9 deletions(-) diff --git a/src/main/java/baritone/Settings.java b/src/main/java/baritone/Settings.java index d29ec995..eb673efd 100644 --- a/src/main/java/baritone/Settings.java +++ b/src/main/java/baritone/Settings.java @@ -145,12 +145,6 @@ public class Settings { */ public Setting minimumImprovementRepropagation = new Setting<>(true); - /** - * Use a pythagorean metric (as opposed to the more accurate hybrid diagonal / traverse). - * You probably don't want this. It roughly triples nodes considered for no real advantage. - */ - public Setting pythagoreanMetric = new Setting<>(false); - /** * After calculating a path (potentially through cached chunks), artificially cut it off to just the part that is * entirely within currently loaded chunks. Improves path safety because cached chunks are heavily simplified. diff --git a/src/main/java/baritone/pathing/goals/GoalXZ.java b/src/main/java/baritone/pathing/goals/GoalXZ.java index 8abfb221..71808222 100644 --- a/src/main/java/baritone/pathing/goals/GoalXZ.java +++ b/src/main/java/baritone/pathing/goals/GoalXZ.java @@ -65,9 +65,6 @@ public class GoalXZ implements Goal { } public static double calculate(double xDiff, double zDiff) { - if (Baritone.settings().pythagoreanMetric.get()) { - return Math.sqrt(xDiff * xDiff + zDiff * zDiff) * Baritone.settings().costHeuristic.get(); - } //This is a combination of pythagorean and manhattan distance //It takes into account the fact that pathing can either walk diagonally or forwards