Kunstig Intelligens til Brætspillet Taiji - Danmarks Tekniske Universitet

134 Bilag A
192 alpha = n . a ;
193 }
194 i f ( p [ 2 ] == −1){
195 p [2]= nodes [ p [ 0 ] ] [ p [ 1 ] ] . s i z e ( ) ;
196 nodes [ p [ 0 ] ] [ p [ 1 ] ] . add ( n . addChild ( tNode .
createChildNode ( c , r +1, c , r , n ) ) ) ;
197 count++;
198 i n t v = min ( nodes [ p [ 0 ] ] [ p [ 1 ] ] . get ( p [ 2 ] )
, alpha , beta , 0 ) ;
199 i f ( n . a < v )
200 n . a = v ;
201 i f ( n . a > beta ) {
202 b [ c ] [ r ] = 2 ;
203 b [ c ] [ r +1] = 2 ;
204 r e t u r n ( n . a ) ;
205 }
206 i f ( alpha < n . a )
207 alpha = n . a ;
208 }
209
210 b [ c ] [ r ] = 2 ;
211 b [ c ] [ r +1] = 2 ;
212 }
213 }
214 }
215
216 f o r ( i n t c=c o l S t a r t ; c beta ) {
230 b [ c ] [ r ] = 2 ;
231 b [ c +1][ r ] = 2 ;
232 r e t u r n ( n . a ) ;
233 }
234 i f ( alpha < n . a )
235 alpha = n . a ;
236 }
237 i f ( p [ 2 ] == −1){
238 p [2]= nodes [ p [ 0 ] ] [ p [ 1 ] ] . s i z e ( ) ;
239 nodes [ p [ 0 ] ] [ p [ 1 ] ] . add ( n . addChild ( tNode .
createChildNode ( c , r , c +1, r , n ) ) ) ;
240 count++;