small touchups.

Author: LoneWandererProductions

Pathfinder/Node.cs

@@ -122,9 +122,20 @@ internal Node(int x, int y, int g, int h, int movementCost, Node parent = null)
         ///         </item>
         ///     </list>
         /// </returns>
-        public int CompareTo(Node other)
+        public int CompareTo(Node? other)
         {
-            return F.CompareTo(other.F);
+            if (other is null) return 1;
+
+            // Primary Sort: Lowest F cost first
+            int compare = F.CompareTo(other.F);
+
+            // Tie-breaker: If F is equal, pick the one closer to the goal (lower H)
+            if (compare == 0)
+            {
+                compare = H.CompareTo(other.H);
+            }
+
+            return compare;
         }
     }
 }

Pathfinder/Pathfinding.cs

@@ -15,7 +15,7 @@ namespace Pathfinder
     /// <summary>
     ///     Implementation of the A* pathfinder algorithm.
     /// </summary>
-    public sealed partial class Pathfinding : IPathfinding
+    public sealed class Pathfinding : IPathfinding
     {
         /// <summary>
         /// The diagonal cost
@@ -82,7 +82,7 @@ public PathfinderResults FindPath(int startX, int startY, int goalX, int goalY,
             while (openList.Count > 0)
             {
                 var currentNode = openList.Min;
-                openList.Remove(currentNode);
+                _ = openList.Remove(currentNode);
 
                 if (currentNode.X == goalX && currentNode.Y == goalY)
                 {
@@ -127,7 +127,7 @@ public PathfinderResults FindPath(int startX, int startY, int goalX, int goalY,
         /// </summary>
         /// <param name="goalNode">The goal node.</param>
         /// <returns>A list of nodes representing the path from start to goal.</returns>
-        private List<Node> BuildPath(Node goalNode)
+        private static List<Node> BuildPath(Node goalNode)
         {
             var path = new List<Node>();
             var currentNode = goalNode;