Kunstig Intelligens til Brætspillet Taiji - Danmarks Tekniske Universitet

144 Bilag A
90 b [ c ] [ r ] = 0 ;
91 b [ c ] [ r +1] = 1 ;
92 i = c h e c k B o a r d I n d i v i d u a l i t y ( b , d ) ;
93 // System . out . p r i n t l n (” minimax checkBI2 i= ”+ i ) ;
94 i f ( i >= 0) {
95 i f ( d % 2 == 1)
96 tTree . evenGen . get ( i ) . par . add ( p ) ;
97 i f ( d % 2 == 0)
98 tTree . oddGen . get ( i ) . par . add ( p ) ;
99 }
100 i f ( i == −1){
101 i f ( d % 2 == 1) {
102 tTree . evenGen . add ( p . addChild ( tNode .
createChildNode ( c , r +1, c , r , p ) ) ) ;
103 count++;
104 }
105 i f ( d % 2 == 0) {
106 tTree . oddGen . add ( p . addChild ( tNode .
createChildNode ( c , r +1, c , r , p ) ) ) ;
107 count++;
108 }
109 }
110 b [ c ] [ r ] = 2 ;
111 b [ c ] [ r +1] = 2 ;
112
113 // tTree . addLeave ( p . addChild ( tNode .
createChildNode ( c , r , c , r +1, p ) ) ) ;
114 // tTree . addLeave ( p . addChild ( tNode .
createChildNode ( c , r +1, c , r , p ) ) ) ;
115 }
116
117 }
118 }
119 f o r ( i n t c =0; c < tModel . noCols −1; c++){
120 f o r ( i n t r =0; r < tModel . noRows ; r++){
121 i f ( b [ c ] [ r ] == 2 && b [ c +1][ r ] == 2 ) {
122 b [ c ] [ r ] = 1 ;
123 b [ c +1][ r ] = 0 ;
124 i n t i ;
125 i = c h e c k B o a r d I n d i v i d u a l i t y ( b , d ) ;
126 // System . out . p r i n t l n (” minimax checkBoardIndi i
= ”+ i ) ;
127 i f ( i >= 0) {
128 i f ( d % 2 == 1)
129 tTree . evenGen . get ( i ) . par . add ( p ) ;
130 i f ( d % 2 == 0)
131 tTree . oddGen . get ( i ) . par . add ( p ) ;
132 }
133 i f ( i == −1){
134 i f ( d % 2 == 1) {
135 tTree . evenGen . add ( p . addChild ( tNode .
createChildNode ( c , r , c +1, r , p ) ) ) ;
136 count++;
137 }
138 i f ( d % 2 == 0) {