Kunstig Intelligens til Brætspillet Taiji - Danmarks Tekniske Universitet

100 Bilag A
218 i f ( n . a > beta ) {
219 b [ c ] [ r ] = 2 ;
220 b [ c +1][ r ] = 2 ;
221 r e t u r n ( n . a ) ;
222 }
223 i f ( alpha < n . a )
224 alpha = n . a ;
225 }
226 i f ( p [ 2 ] == −1){
227 p [2]= nodes [ p [ 0 ] ] [ p [ 1 ] ] . s i z e ( ) ;
228 nodes [ p [ 0 ] ] [ p [ 1 ] ] . add ( n . addChild ( tNode .
createChildNode ( c +1, r , c , r , n ) ) ) ;
229 count++;
230 i n t v = min ( nodes [ p [ 0 ] ] [ p [ 1 ] ] . get ( p [ 2 ] )
, alpha , beta , 0 ) ;
231 i f ( n . a < v )
232 n . a = v ;
233 i f ( n . a > beta ) {
234 b [ c ] [ r ] = 2 ;
235 b [ c +1][ r ] = 2 ;
236 r e t u r n ( n . a ) ;
237 }
238 i f ( alpha < n . a )
239 alpha = n . a ;
240 }
241 b [ c ] [ r ] = 2 ;
242 b [ c +1][ r ] = 2 ;
243 }
244 }
245 }
246 r e t u r n ( n . a ) ;
247 }
248 }
249
250 // Min−f u n k t i o n e n i minimax−soegningen
251 p r i v a t e i n t min ( Node n , i n t alpha , i n t beta , i n t ex ) {
252 i f ( n . d >= searchD | | ! tModel . movesLeftN ( n ) ) {
253 n . a = tModel . fMap . c a l D i f ( n . nodeBoard , tModel . noCols ,
tModel . noRows ) ;
254 r e t u r n ( n . a ) ;
255 }
256 e l s e {
257 i f ( ex == 1) {
258 i f ( n . a