Kunstig Intelligens til Brætspillet Taiji - Danmarks Tekniske Universitet

154 Bilag A
532 // System . out . p r i n t l n ( tTree . Leaves [ i ] . c h i l d r e n . get ( j
) . nodeBoard [ 0 ] [ 2 ] + ” ”+tTree . Leaves [ i ] . c h i l d r e n . get ( j ) .
nodeBoard [ 1 ] [ 2 ] + ” ”+tTree . Leaves [ i ] . c h i l d r e n . get ( j ) .
nodeBoard [ 2 ] [ 2 ] ) ;
533 // System . out . p r i n t l n ( ) ;
534 // }
535 //}
536
537 p r i v a t e boolean checkMaxMin ( ) {
538 f o r ( i n t i = 0 ; i < tTree . oddGen . s i z e ( ) ; i ++){
539 i f ( tTree . oddGen . get ( i ) == n u l l ) {
540 System . out . p r i n t l n (” Null i ”+ i +” s i z e even ”+tTree
. curMax ) ;
541 r e t u r n ( f a l s e ) ;
542 }
543 }
544 f o r ( i n t j = 0 ; j < tTree . evenGen . s i z e ( ) ; j++){
545 i f ( tTree . evenGen . get ( j ) == n u l l ) {
546 System . out . p r i n t l n (” Null j ”+ j +” s i z e odd ”+tTree .
curMin ) ;
547 r e t u r n ( f a l s e ) ;
548 }
549
550 }
551 r e t u r n ( t r u e ) ;
552 }
553
554 p r i v a t e boolean checkMaxMinPar ( ) {
555 f o r ( i n t i = 0 ; i < tTree . oddGen . s i z e ( ) ; i ++){
556 i f ( tTree . oddGen . get ( i ) . par == n u l l ) {
557 System . out . p r i n t l n (” Null Par i ”+ i +” odd ”+tTree .
oddGen . s i z e ( ) ) ;
558 r e t u r n ( f a l s e ) ;
559 }
560 }
561 f o r ( i n t j = 0 ; j < tTree . evenGen . s i z e ( ) ; j++){
562 i f ( tTree . evenGen . get ( j ) . par == n u l l ) {
563 System . out . p r i n t l n (” Null Par j ”+ j +” even ”+tTree .
evenGen . s i z e ( ) ) ;
564 r e t u r n ( f a l s e ) ;
565 }
566
567 }
568 r e t u r n ( t r u e ) ;
569 }
570
571 // e r s a e t t e s maxDepth
572 p r i v a t e void setMaxDepth ( i n t mode ) {
573 // i ”Mode 0” f o r s o e g e r den at regne h e l e t r a e e t igennem
574 i f ( mode == 0) {
575 maxDepth = ( tModel . noCols ∗ tModel . noRows /2) ;
576 System . out . p r i n t l n (” minimax Mode 0 maxDepth = ”+
maxDepth ) ;
577 }