Kunstig Intelligens til Brætspillet Taiji - Danmarks Tekniske Universitet

A.3 AITaijiLocalAreaAB.java 139
439 count++;
440 i n t v = max( nodes [ p [ 0 ] ] [ p [ 1 ] ] . get ( p [ 2 ] )
, alpha , beta , 0 ) ;
441 i f ( n . a > v )
442 n . a = v ;
443 i f ( n . a < alpha ) {
444 b [ c ] [ r ] = 2 ;
445 b [ c +1][ r ] = 2 ;
446 r e t u r n ( n . a ) ;
447 }
448 i f ( beta > n . a )
449 beta = n . a ;
450 }
451 b [ c ] [ r ] = 2 ;
452 b [ c +1][ r ] = 2 ;
453 }
454 }
455 }
456 r e t u r n ( n . a ) ;
457 }
458 }
459
460
461
462
463 // s a e t t e r s c o r e n f o r en node t i l −”u e n d e l i g ”
464 p r i v a t e Node setScoreMin ( Node n ) {
465 n . a = −tModel . maxScore ;
466 r e t u r n ( n ) ;
467 }
468 // s a e t t e r s c o r e n f o r en node t i l ” u e n d e l i g ”
469 p r i v a t e Node setScoreMax ( Node n ) {
470 n . a = tModel . maxScore ;
471 r e t u r n ( n ) ;
472 }
473
474
475
476 p u b l i c Node returnMove ( boolean b ) {
477 i f ( tModel . currentTurn == 1) {
478 tNode = new Node ( ) ;
479 Root = tNode . createNode ( tModel . currentTurn , tModel ) ;
480 Root . wc=tModel . noCols / 2 ;
481 Root . wr=tModel . noCols / 2 ;
482 Root . bc=Root . wc ;
483 Root . br=Root . wr+1;
484 r e t u r n ( Root ) ;
485 }
486 LocalAreaAB ( ) ;
487
488 w h i l e ( Root . c h i l d r e n . s i z e ( ) == 0 && tModel . movesLeft ( ) ) {
489 i f ( b )
490 min ( Root ,−tModel . maxScore , tModel . maxScore , 0 ) ;
491 i f ( ! b )
492 max( Root ,−tModel . maxScore , tModel . maxScore , 0 ) ;