Kunstig Intelligens til Brætspillet Taiji - Danmarks Tekniske Universitet

A.1 AITaijiAlphaBeta.java 97
69 i n t h = tModel . tHash . hashFunction3 ( b ) ;
70 p [0]= d ; / / d ;
71 p [1]= h ;
72 p[2]= −1;
73 f o r ( i n t i = 0 ; i = searchD | | ! tModel . movesLeftN ( n ) ) {
85 n . a = tModel . fMap . c a l D i f ( n . nodeBoard , tModel . noCols ,
tModel . noRows ) ;
86 r e t u r n ( n . a ) ;
87 }
88 e l s e {
89 i f ( ex == 1) {
90 i f ( n . a >= beta )
91 r e t u r n ( n . a ) ;
92 }
93 n . a = −tModel . maxScore ;
94 i n t [ ] [ ] b = n . nodeBoard ;
95 i n t d = n . d ;
96 f o r ( i n t c =0; c < tModel . noCols ; c++){
97 f o r ( i n t r =0; r < tModel . noRows−1; r++){
98 i f ( b [ c ] [ r ] == 2 && b [ c ] [ r +1] == 2 ) {
99 b [ c ] [ r ] = 1 ;
100 b [ c ] [ r +1] = 0 ;
101 i n t [ ] p = new i n t [ 3 ] ;
102 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 ) ;
103 i f ( p [ 2 ] >= 0) {
104 nodes [ p [ 0 ] ] [ p [ 1 ] ] . get ( p [ 2 ] ) . par . add ( n ) ;
105 n . c h i l d r e n . add ( nodes [ p [ 0 ] ] [ p [ 1 ] ] . get ( p
[ 2 ] ) ) ;
106 i n t v = min ( nodes [ p [ 0 ] ] [ p [ 1 ] ] . get ( p [ 2 ] )
, alpha , beta , 1 ) ;
107 i f ( n . a < v )
108 n . a = v ;
109 i f ( n . a > beta ) {
110 b [ c ] [ r ] = 2 ;
111 b [ c ] [ r +1] = 2 ;
112 r e t u r n ( n . a ) ;
113 }
114 i f ( alpha < n . a )
115 alpha = n . a ;
116
117 }
118 i f ( p [ 2 ] == −1){
119 p [2]= nodes [ p [ 0 ] ] [ p [ 1 ] ] . s i z e ( ) ;