-
Notifications
You must be signed in to change notification settings - Fork 0
/
NodeUntil.java
152 lines (131 loc) · 7.53 KB
/
NodeUntil.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
/*
* To change this license header, choose License Headers in Project Properties.
* To change this template file, choose Tools | Templates
* and open the template in the editor.
*/
package puzzleproject;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Set;
import java.util.Stack;
//This is a utility class that can do some operations on a node. for example getSuccessors() return the successors of a node
public class NodeUntil {
public static List<String> getSuccessors(String state) {
List<String> successors = new ArrayList<String>();
switch (state.indexOf("0")) {
case 0: {
successors.add(state.replace(state.charAt(0), '*').replace(state.charAt(1), state.charAt(0)).replace('*', state.charAt(1)));
successors.add(state.replace(state.charAt(0), '*').replace(state.charAt(3), state.charAt(0)).replace('*', state.charAt(3)));
break;
}
case 1: {
successors.add(state.replace(state.charAt(1), '*').replace(state.charAt(0), state.charAt(1)).replace('*', state.charAt(0)));
successors.add(state.replace(state.charAt(1), '*').replace(state.charAt(2), state.charAt(1)).replace('*', state.charAt(2)));
successors.add(state.replace(state.charAt(1), '*').replace(state.charAt(4), state.charAt(1)).replace('*', state.charAt(4)));
break;
}
case 2: {
successors.add(state.replace(state.charAt(2), '*').replace(state.charAt(1), state.charAt(2)).replace('*', state.charAt(1)));
successors.add(state.replace(state.charAt(2), '*').replace(state.charAt(5), state.charAt(2)).replace('*', state.charAt(5)));
break;
}
case 3: {
successors.add(state.replace(state.charAt(3), '*').replace(state.charAt(0), state.charAt(3)).replace('*', state.charAt(0)));
successors.add(state.replace(state.charAt(3), '*').replace(state.charAt(4), state.charAt(3)).replace('*', state.charAt(4)));
successors.add(state.replace(state.charAt(3), '*').replace(state.charAt(6), state.charAt(3)).replace('*', state.charAt(6)));
break;
}
case 4: {
successors.add(state.replace(state.charAt(4), '*').replace(state.charAt(1), state.charAt(4)).replace('*', state.charAt(1)));
successors.add(state.replace(state.charAt(4), '*').replace(state.charAt(3), state.charAt(4)).replace('*', state.charAt(3)));
successors.add(state.replace(state.charAt(4), '*').replace(state.charAt(5), state.charAt(4)).replace('*', state.charAt(5)));
successors.add(state.replace(state.charAt(4), '*').replace(state.charAt(7), state.charAt(4)).replace('*', state.charAt(7)));
break;
}
case 5: {
successors.add(state.replace(state.charAt(5), '*').replace(state.charAt(2), state.charAt(5)).replace('*', state.charAt(2)));
successors.add(state.replace(state.charAt(5), '*').replace(state.charAt(4), state.charAt(5)).replace('*', state.charAt(4)));
successors.add(state.replace(state.charAt(5), '*').replace(state.charAt(8), state.charAt(5)).replace('*', state.charAt(8)));
break;
}
case 6: {
successors.add(state.replace(state.charAt(6), '*').replace(state.charAt(3), state.charAt(6)).replace('*', state.charAt(3)));
successors.add(state.replace(state.charAt(6), '*').replace(state.charAt(7), state.charAt(6)).replace('*', state.charAt(7)));
break;
}
case 7: {
successors.add(state.replace(state.charAt(7), '*').replace(state.charAt(4), state.charAt(7)).replace('*', state.charAt(4)));
successors.add(state.replace(state.charAt(7), '*').replace(state.charAt(6), state.charAt(7)).replace('*', state.charAt(6)));
successors.add(state.replace(state.charAt(7), '*').replace(state.charAt(8), state.charAt(7)).replace('*', state.charAt(8)));
break;
}
case 8: {
successors.add(state.replace(state.charAt(8), '*').replace(state.charAt(5), state.charAt(8)).replace('*', state.charAt(5)));
successors.add(state.replace(state.charAt(8), '*').replace(state.charAt(7), state.charAt(8)).replace('*', state.charAt(7)));
break;
}
}
return successors;
}
/**
*
* prints the transitions along with the states starting from the initial states
* to the goal state.
*
*/
public static void printSolution(Node goalNode, Set<String> visitedNodes, Node root, int time) {
int totalCost ;
Stack<Node> solutionStack = new Stack<Node>();
solutionStack.push(goalNode);
while (!goalNode.getState().equals(root.getState())) {
solutionStack.push(goalNode.getParent());
goalNode = goalNode.getParent();
}
solutionStack.push(root);
totalCost=solutionStack.size()-1;
String sourceState = root.getState();
String destinationState;
String []transition=new String [solutionStack.size() - 1];
for (int i = solutionStack.size() - 1; i >= 0; i--) {
System.out.println("____________________________________________________________________");
destinationState = solutionStack.get(i).getState();
if (!sourceState.equals(destinationState)) {
System.out.println("Move " + destinationState.charAt(sourceState.indexOf('0')) + " " + findTransition(sourceState, destinationState));
transition[i]=findTransition(sourceState, destinationState).toString();
}
sourceState = destinationState;
System.out.println("*******");
System.out.println("* " + solutionStack.get(i).getState().substring(0, 3)+" *");
System.out.println("* " + solutionStack.get(i).getState().substring(3, 6)+" *");
System.out.println("* " + solutionStack.get(i).getState().substring(6, 9)+" *");
System.out.println("*******");
}
System.out.println("____________________________________________________________________");
System.out.println("-> Path To Goal: " + Arrays.toString(transition));
System.out.println("-> Number of nodes expanded: " + (visitedNodes.size()));
System.out.println("-> Cost of path: " + totalCost);
System.out.println("-> Search depth: " + time);
System.out.println("____________________________________________________________________");
}
//*******************************************************************************************
/**
*
* @return returns the transition between two states.
*
*/
public static MovementType findTransition(String source, String destination) {
int zero_position_difference = destination.indexOf('0') - source.indexOf('0');
switch (zero_position_difference) {
case -3:
return MovementType.DOWN;
case 3:
return MovementType.UP;
case 1:
return MovementType.LEFT;
case -1:
return MovementType.RIGHT;
}
return null;
}
}