Implemented A* at full state

src/search/EightPuzzleNode.java

@@ -17,6 +17,11 @@ public class EightPuzzleNode extends Node<int[][]>
         super(value, parent);
     }
 
+    private EightPuzzleNode(final int[][] value, final Node<int[][]> parent, final int heuristicCosts)
+    {
+        super(value, parent, heuristicCosts);
+    }
+
     @Override
     public boolean isTargetReached(final Node<int[][]> target)
     {
@@ -44,7 +49,8 @@ public class EightPuzzleNode extends Node<int[][]>
                     case LEFT -> new IntPair(x-1, y);
                 };
 
-                final var successor = this.swapStateField(newState, emptyPosition, posToSwap);
+                this.swapStateField(newState, emptyPosition, posToSwap);
+                final var successor = new EightPuzzleNode(newState, this, super.heuristicCosts+1);
 
                 if (!successor.valueEquals(this) && !successor.valueEquals(super.getParent()))
                 {
@@ -121,35 +127,11 @@ public class EightPuzzleNode extends Node<int[][]>
         return copy;
     }
 
-    private EightPuzzleNode swapStateField(final int[][] newState, final IntPair emptyPos, final IntPair posToSwap)
+    private void swapStateField(final int[][] newState, final IntPair emptyPos, final IntPair posToSwap)
     {
         final var tmp = newState[posToSwap.getY()][posToSwap.getX()];
         newState[posToSwap.getY()][posToSwap.getX()] = newState[emptyPos.getY()][emptyPos.getX()];
         newState[emptyPos.getY()][emptyPos.getX()] = tmp;
-
-        return new EightPuzzleNode(newState, this);
-    }
-
-    private class IntPair
-    {
-        private final int x;
-        private final int y;
-
-        public IntPair(final int x, final int y)
-        {
-            this.x = x;
-            this.y = y;
-        }
-
-        public int getX()
-        {
-            return x;
-        }
-        public int getY()
-        {
-            return y;
-        }
-
     }
 
     private enum Direction

src/search/IntPair.java

@@ -0,0 +1,23 @@
+package search;
+
+public class IntPair
+{
+    private final int x;
+    private final int y;
+
+    public IntPair(final int x, final int y)
+    {
+        this.x = x;
+        this.y = y;
+    }
+
+    public int getX()
+    {
+        return x;
+    }
+    public int getY()
+    {
+        return y;
+    }
+
+}

src/search/Node.java

@@ -1,24 +1,30 @@
 package search;
 
-import search.heuristic.Heuristic;
-
 import java.util.List;
 import java.util.Objects;
 
 public abstract class Node<T>
 {
     protected final T value;
+    protected int heuristicCosts;
     private final Node<T> parent;
+    private int heuristicEstimation;
 
     protected Node(final T value)
     {
-        this(value, null);
+        this(value, null, 0);
     }
 
     protected Node(final T value, final Node<T> parent)
+    {
+        this(value, parent, 0);
+    }
+
+    protected Node(final T value, final Node<T> parent, final int heuristicCosts)
     {
         this.value = Objects.requireNonNull(value);
         this.parent = parent;
+        this.heuristicCosts = heuristicCosts;
     }
 
     public T getValue()
@@ -31,6 +37,16 @@ public abstract class Node<T>
         return this.parent;
     }
 
+    public int getHeuristic()
+    {
+        return heuristicCosts + heuristicEstimation;
+    }
+
+    public void setHeuristicEstimation(final int heuristicEstimation)
+    {
+        this.heuristicEstimation = heuristicEstimation;
+    }
+
     public abstract boolean isTargetReached(final Node<T> target);
     public abstract List<Node<T>> generateSuccessors();
 }

src/search/heuristic/AStar.java

@@ -7,16 +7,17 @@ import java.util.PriorityQueue;
 
 public class AStar<T>
 {
-    private final Heuristic<T> heuristicFunction;
+    private final HeuristicEstimationFunction<T> heuristicFunction;
 
-    public AStar(final Heuristic<T> heuristicFunction)
+    public AStar(final HeuristicEstimationFunction<T> heuristicFunction)
     {
         this.heuristicFunction = heuristicFunction;
     }
 
     public Node<T> heuristicSearch(final Node<T> start, final Node<T> target)
     {
-        final var nodes = new PriorityQueue<Node<T>>(Comparator.comparingInt(node -> heuristicFunction.heuristic(node, target)));
+        final var nodes = new PriorityQueue<Node<T>>(Comparator.comparingInt(Node::getHeuristic));
+        start.setHeuristicEstimation(this.heuristicFunction.heuristicEstimation(start, target));
         nodes.add(start);
 
         while (true)
@@ -33,7 +34,14 @@ public class AStar<T>
                 return node;
             }
 
-            nodes.addAll(node.generateSuccessors());
+            final var successors = node.generateSuccessors();
+
+            for (final var successor : successors)
+            {
+                successor.setHeuristicEstimation(this.heuristicFunction.heuristicEstimation(successor, target));
+            }
+
+            nodes.addAll(successors);
         }
     }
 }

src/search/heuristic/Heuristic.java

@@ -1,8 +0,0 @@
-package search.heuristic;
-
-import search.Node;
-
-public interface Heuristic<T>
-{
-    int heuristic(Node<T> node, Node<T> target);
-}

src/search/heuristic/HeuristicEstimationFunction.java

@@ -0,0 +1,8 @@
+package search.heuristic;
+
+import search.Node;
+
+public interface HeuristicEstimationFunction<T>
+{
+    int heuristicEstimation(Node<T> node, Node<T> target);
+}