private static void constructPath(SearchNode searchNode) {
if (searchNode.getParent() == null) { // We're at the start node
System.out.println("(i,j)=(" + searchNode.getxPos() + "," + searchNode.getyPos() + ")");
System.out.println("F cost: " + searchNode.getFscore());
System.out.println("G cost: " + searchNode.getgScore());
return;
}
constructPath(searchNode.getParent());
searchNode.getOperator().print();
System.out.println();
System.out.println("(i,j)=(" + searchNode.getxPos() + "," + searchNode.getyPos() + ")");
System.out.println("F cost: " + searchNode.getFscore());
System.out.println("G cost: " + searchNode.getgScore());
if (g.isGoal(searchNode.getGridState())) {
System.out.println("\nFinal cost is: " + searchNode.getgScore());
}
}
public void testSmall() {
State node5 = new State(5, 0, 0, true);
State node6 = new State(6, 0, 0, true);
State node2 = new State(2, 1, 6, false);
node2.next[0] = node5;
node2.cost[0] = 6;
State node3 = new State(3, 2, 2, false);
node3.next[0] = node5;
node3.cost[0] = 4;
node3.next[1] = node6;
node3.cost[1] = 2;
State node4 = new State(4, 1, 6, false);
node4.next[0] = node6;
node4.cost[0] = 6;
State node0 = new State(0, 2, 4, false);
node0.next[0] = node2;
node0.cost[0] = 2;
node0.next[1] = node3;
node0.cost[1] = 2;
State node1 = new State(1, 2, 3, false);
node1.next[0] = node3;
node1.cost[0] = 1;
node1.next[1] = node4;
node1.cost[1] = 1;
State[][] paths = new State[6][];
double[] costs = new double[6];
paths[0] = new State[] {node6, node3, node1};
costs[0] = 3;
paths[1] = new State[] {node6, node3, node0};
costs[1] = 4;
paths[2] = new State[] {node5, node3, node1};
costs[2] = 5;
paths[3] = new State[] {node5, node3, node0};
costs[3] = 6;
paths[4] = new State[] {node6, node4, node1};
costs[4] = 7;
paths[5] = new State[] {node5, node2, node0};
costs[5] = 8;
AStar s = new AStar(new State[] {node0, node1}, 7);
int i = 0;
while (s.hasNext()) {
assertTrue("number of answers > " + i, i < 6);
SearchNode n = s.nextAnswer();
assertEquals("costs[" + i + "] != " + n.getPriority(), costs[i], n.getPriority(), 1e-5);
int j = 0;
while (n != null) {
assertTrue("path length > " + j, j < 3);
assertTrue("path[" + i + "][" + j + "] != " + n, paths[i][j] == n.getState());
j++;
n = (SearchNode) n.getParent();
}
assertTrue("path length != " + j, j == 3);
i++;
}
assertTrue("number of answers != " + i, i == 6);
}
private void reconstructMoves(SearchNode searcher) {
while (searcher != null) {
solution.add(searcher.getObject());
searcher = searcher.getParent();
}
for (int i = 0; i < solution.size() / 2; ++i) {
T temp = solution.get(i);
int other = solution.size() - i - 1;
solution.set(i, solution.get(other));
solution.set(other, temp);
}
}