Kunstig Intelligens til Brætspillet Taiji - Danmarks Tekniske Universitet

102 Bilag A
319 p [2]= nodes [ p [ 0 ] ] [ p [ 1 ] ] . s i z e ( ) ;
320 nodes [ p [ 0 ] ] [ p [ 1 ] ] . add ( n . addChild ( tNode .
createChildNode ( c , r +1, c , r , n ) ) ) ;
321 count++;
322 i n t v = max( nodes [ p [ 0 ] ] [ p [ 1 ] ] . get ( p [ 2 ] )
, alpha , beta , 0 ) ;
323 i f ( n . a > v )
324 n . a = v ;
325 i f ( n . a < alpha ) {
326 b [ c ] [ r ] = 2 ;
327 b [ c ] [ r +1] = 2 ;
328 r e t u r n ( n . a ) ;
329 }
330 i f ( beta > n . a )
331 beta = n . a ;
332 }
333 b [ c ] [ r ] = 2 ;
334 b [ c ] [ r +1] = 2 ;
335
336
337 }
338 }
339 }
340
341
342 f o r ( i n t c =0; c < tModel . noCols −1; c++){
343 f o r ( i n t r =0; r < tModel . noRows ; r++){
344 i f ( b [ c ] [ r ] == 2 && b [ c +1][ r ] == 2 ) {
345 b [ c ] [ r ] = 1 ;
346 b [ c +1][ r ] = 0 ;
347 i n t [ ] p = new i n t [ 3 ] ;
348 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 ) ;
349 i f ( p [ 2 ] >= 0) {
350 nodes [ p [ 0 ] ] [ p [ 1 ] ] . get ( p [ 2 ] ) . par . add ( n ) ;
351 n . c h i l d r e n . add ( nodes [ p [ 0 ] ] [ p [ 1 ] ] . get ( p
[ 2 ] ) ) ;
352 i n t v = max( nodes [ p [ 0 ] ] [ p [ 1 ] ] . get ( p [ 2 ] )
, alpha , beta , 1 ) ;
353 i f ( n . a > v )
354 n . a = v ;
355 i f ( n . a < alpha ) {
356 b [ c ] [ r ] = 2 ;
357 b [ c +1][ r ] = 2 ;
358 r e t u r n ( n . a ) ;
359 }
360 i f ( beta > n . a )
361 beta = n . a ;
362 }
363 i f ( p [ 2 ] == −1){
364 p [2]= nodes [ p [ 0 ] ] [ p [ 1 ] ] . s i z e ( ) ;
365 nodes [ p [ 0 ] ] [ p [ 1 ] ] . add ( n . addChild ( tNode .
createChildNode ( c , r , c +1, r , n ) ) ) ;
366 count++;
367 i n t v = max( nodes [ p [ 0 ] ] [ p [ 1 ] ] . get ( p [ 2 ] )
, alpha , beta , 0 ) ;