Kunstig Intelligens til Brætspillet Taiji - Danmarks Tekniske Universitet

A.1 AITaijiAlphaBeta.java 103
368 i f ( n . a > v )
369 n . a = v ;
370 i f ( n . a < alpha ) {
371 b [ c ] [ r ] = 2 ;
372 b [ c +1][ r ] = 2 ;
373 r e t u r n ( n . a ) ;
374 }
375 i f ( beta > n . a )
376 beta = n . a ;
377 }
378 b [ c ] [ r ] = 0 ;
379 b [ c +1][ r ] = 1 ;
380
381 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 ) ;
382 i f ( p [ 2 ] >= 0) {
383 nodes [ p [ 0 ] ] [ p [ 1 ] ] . get ( p [ 2 ] ) . par . add ( n ) ;
384 n . c h i l d r e n . add ( nodes [ p [ 0 ] ] [ p [ 1 ] ] . get ( p
[ 2 ] ) ) ;
385 i n t v = max( nodes [ p [ 0 ] ] [ p [ 1 ] ] . get ( p [ 2 ] )
, alpha , beta , 1 ) ;
386 i f ( n . a > v )
387 n . a = v ;
388 i f ( n . a < alpha ) {
389 b [ c ] [ r ] = 2 ;
390 b [ c +1][ r ] = 2 ;
391 r e t u r n ( n . a ) ;
392 }
393 i f ( beta > n . a )
394 beta = n . a ;
395 }
396 i f ( p [ 2 ] == −1){
397 p [2]= nodes [ p [ 0 ] ] [ p [ 1 ] ] . s i z e ( ) ;
398 nodes [ p [ 0 ] ] [ p [ 1 ] ] . add ( n . addChild ( tNode .
createChildNode ( c +1, r , c , r , n ) ) ) ;
399 count++;
400 i n t v = max( nodes [ p [ 0 ] ] [ p [ 1 ] ] . get ( p [ 2 ] )
, alpha , beta , 0 ) ;
401 i f ( n . a > v )
402 n . a = v ;
403 i f ( n . a < alpha ) {
404 b [ c ] [ r ] = 2 ;
405 b [ c +1][ r ] = 2 ;
406 r e t u r n ( n . a ) ;
407 }
408 i f ( beta > n . a )
409 beta = n . a ;
410 }
411 b [ c ] [ r ] = 2 ;
412 b [ c +1][ r ] = 2 ;
413 }
414 }
415 }
416 r e t u r n ( n . a ) ;
417 }
418 }