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<Boolean> 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<Boolean> 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