Kunstig Intelligens til Brætspillet Taiji - Danmarks Tekniske Universitet

A.17 Tree.java 229
30 }
31
32 // t i l f o e j e r e t blad
33 p u b l i c void addLeave ( Node n ) {
34 Leaves . add ( n ) ;
35 }
36
37 p u b l i c void addMin ( Node n ) {
38 curMin++;
39 }
40
41
42 p u b l i c void addMax( Node n ) {
43 curMax++;
44 }
45
46 p u b l i c void resetMin ( ) {
47 curMin =0;
48 }
49
50 p u b l i c void resetMax ( ) {
51 curMax=0;
52 }
53
54 p u b l i c void addLeaveT ( Node n ) {
55 t o t a l L e a v e s ++;
56 }
57
58 p u b l i c void removeLeave ( i n t l ) {
59 Leaves . remove ( l ) ;
60 }
61
62 p u b l i c void removeLeaveT ( i n t l ) {
63 t o t a l L e a v e s −−;
64 }
65
66 p u b l i c void removeLeaveC ( i n t l ) {
67 curLeaves −−;
68 t o t a l L e a v e s −−;
69 }
70
71
72 p u b l i c i n t getCurLeaves ( ) {
73 r e t u r n ( curLeaves ) ;
74 }
75
76 }