Kunstig Intelligens til Brætspillet Taiji - Danmarks Tekniske Universitet

A.3 AITaijiLocalAreaAB.java 133
143 b [ c ] [ r +1] = 0 ;
144 i n t [ ] p = new i n t [ 3 ] ;
145 p = 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 ) ;
146 i f ( p [ 2 ] >= 0) {
147 nodes [ p [ 0 ] ] [ p [ 1 ] ] . get ( p [ 2 ] ) . par . add ( n ) ;
148 n . c h i l d r e n . add ( nodes [ p [ 0 ] ] [ p [ 1 ] ] . get ( p
[ 2 ] ) ) ;
149 i n t v = min ( nodes [ p [ 0 ] ] [ p [ 1 ] ] . get ( p [ 2 ] )
, alpha , beta , 1 ) ;
150 i f ( n . a < v )
151 n . a = v ;
152 i f ( n . a > beta ) {
153 b [ c ] [ r ] = 2 ;
154 b [ c ] [ r +1] = 2 ;
155 r e t u r n ( n . a ) ;
156 }
157 i f ( alpha < n . a )
158 alpha = n . a ;
159
160 }
161 i f ( p [ 2 ] == −1){
162 p [2]= nodes [ p [ 0 ] ] [ p [ 1 ] ] . s i z e ( ) ;
163 nodes [ p [ 0 ] ] [ p [ 1 ] ] . add ( n . addChild ( tNode .
createChildNode ( c , r , c , r +1, n ) ) ) ;
164 count++;
165 i n t v = min ( nodes [ p [ 0 ] ] [ p [ 1 ] ] . get ( p [ 2 ] )
, alpha , beta , 0 ) ;
166 i f ( n . a < v )
167 n . a = v ;
168 i f ( n . a > beta ) {
169 b [ c ] [ r ] = 2 ;
170 b [ c ] [ r +1] = 2 ;
171 r e t u r n ( n . a ) ;
172 }
173 i f ( alpha < n . a )
174 alpha = n . a ;
175
176 }
177 b [ c ] [ r ] = 0 ;
178 b [ c ] [ r +1] = 1 ;
179 p = 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 ) ;
180 i f ( p [ 2 ] >= 0) {
181 nodes [ p [ 0 ] ] [ p [ 1 ] ] . get ( p [ 2 ] ) . par . add ( n ) ;
182 n . c h i l d r e n . add ( nodes [ p [ 0 ] ] [ p [ 1 ] ] . get ( p
[ 2 ] ) ) ;
183 i n t v = min ( nodes [ p [ 0 ] ] [ p [ 1 ] ] . get ( p [ 2 ] )
, alpha , beta , 1 ) ;
184 i f ( n . a < v )
185 n . a = v ;
186 i f ( n . a > beta ) {
187 b [ c ] [ r ] = 2 ;
188 b [ c ] [ r +1] = 2 ;
189 r e t u r n ( n . a ) ;
190 }
191 i f ( alpha < n . a )