-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathalgoTree.java
60 lines (49 loc) · 1.13 KB
/
algoTree.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
import java.util.ArrayList;
import java.util.List;
public class algoTree {
Integer turn;
algoTree parent;
Integer[] a;//available spots
Integer[] enemy;//player controlled tiles
Integer[] mine;//computer controller tiles
Integer move;//where on board do we move
Integer depth;//depth of tree
Integer val;//node value
Boolean term = false;//true if terminal node
List<algoTree> child = new ArrayList<algoTree>();
public algoTree (Integer depth, Integer[] a, Integer[] enemy, Integer[] mine, Integer move){
this.turn = turn;
this.parent = parent;
this.depth = depth;
this.a = a;
this.enemy = enemy;
this.mine = mine;
this.move = move;
}
public void addChild(algoTree c) {
child.add(c);
}
public List<algoTree> getChildren() {
return child;
}
public void setTerm(boolean setter) {
term = setter;
//System.out.println("set True");
}
public Boolean getTerm() {
return term;
}
public void setVal(Integer v) {
val = v;
}
public Integer getVal() {
return val;
}
public void setMove(Integer m) {
move = m;
//System.out.println("set move " + m);
}
public Integer getMove() {
return move;
}
}