Kunstig Intelligens til Brætspillet Taiji - Danmarks Tekniske Universitet

138 Bilag A
391 n . c h i l d r e n . add ( nodes [ p [ 0 ] ] [ p [ 1 ] ] . get ( p
[ 2 ] ) ) ;
392 i n t v = max( nodes [ p [ 0 ] ] [ p [ 1 ] ] . get ( p [ 2 ] )
, alpha , beta , 1 ) ;
393 i f ( n . a > v )
394 n . a = v ;
395 i f ( n . a < alpha ) {
396 b [ c ] [ r ] = 2 ;
397 b [ c +1][ r ] = 2 ;
398 r e t u r n ( n . a ) ;
399 }
400 i f ( beta > n . a )
401 beta = n . a ;
402 }
403 i f ( p [ 2 ] == −1){
404 p [2]= nodes [ p [ 0 ] ] [ p [ 1 ] ] . s i z e ( ) ;
405 nodes [ p [ 0 ] ] [ p [ 1 ] ] . add ( n . addChild ( tNode .
createChildNode ( c , r , c +1, r , n ) ) ) ;
406 count++;
407 i n t v = max( nodes [ p [ 0 ] ] [ p [ 1 ] ] . get ( p [ 2 ] )
, alpha , beta , 0 ) ;
408 i f ( n . a > v )
409 n . a = v ;
410 i f ( n . a < alpha ) {
411 b [ c ] [ r ] = 2 ;
412 b [ c +1][ r ] = 2 ;
413 r e t u r n ( n . a ) ;
414 }
415 i f ( beta > n . a )
416 beta = n . a ;
417 }
418 b [ c ] [ r ] = 0 ;
419 b [ c +1][ r ] = 1 ;
420
421 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 ) ;
422 i f ( p [ 2 ] >= 0) {
423 nodes [ p [ 0 ] ] [ p [ 1 ] ] . get ( p [ 2 ] ) . par . add ( n ) ;
424 n . c h i l d r e n . add ( nodes [ p [ 0 ] ] [ p [ 1 ] ] . get ( p
[ 2 ] ) ) ;
425 i n t v = max( nodes [ p [ 0 ] ] [ p [ 1 ] ] . get ( p [ 2 ] )
, alpha , beta , 1 ) ;
426 i f ( n . a > v )
427 n . a = v ;
428 i f ( n . a < alpha ) {
429 b [ c ] [ r ] = 2 ;
430 b [ c +1][ r ] = 2 ;
431 r e t u r n ( n . a ) ;
432 }
433 i f ( beta > n . a )
434 beta = n . a ;
435 }
436 i f ( p [ 2 ] == −1){
437 p [2]= nodes [ p [ 0 ] ] [ p [ 1 ] ] . s i z e ( ) ;
438 nodes [ p [ 0 ] ] [ p [ 1 ] ] . add ( n . addChild ( tNode .
createChildNode ( c +1, r , c , r , n ) ) ) ;