Kunstig Intelligens til Brætspillet Taiji - Danmarks Tekniske Universitet

126 Bilag A
916 i f ( n . a > v )
917 n . a = v ; // 1 = alpha beta pruning s l a a e t t i l , 0 =
s l a a e t f r a ( s l a a e t f r a da denne g i v e r problemer
)
918 i f ( n . a < alpha ) {
919 r e [ 0 ] = 0 ;
920 r e [1]= alpha ;
921 r e [2]= beta ;
922 r e [3]= n . a ;
923 r e t u r n ( r e ) ;
924 }
925 i f ( beta > n . a )
926 beta = n . a ;
927 }
928 r e t u r n ( r e ) ;
929 }
930
931
932
933
934
935
936 // s a e t t e r s c o r e n f o r en node t i l lower bound
937 p r i v a t e Node setScoreMin ( Node n ) {
938 n . a = −tModel . maxScore ;
939 r e t u r n ( n ) ;
940 }
941 // s a e t t e r s c o r e n f o r en node t i l e t upper bound
942 p r i v a t e Node setScoreMax ( Node n ) {
943 n . a = tModel . maxScore ;
944 r e t u r n ( n ) ;
945 }
946
947
948
949 // u d s k r i v e r f i g B o a r d e t f o r 4x4 e l l e r 9x9 p l a d e r
950 p r i v a t e void printFB ( i n t [ ] [ ] fb ) {
951 i f ( tModel . noCols > 8 && tModel . noRows > 8)
952 printFB9x9 ( fb ) ;
953 e l s e
954 printFB4x4 ( fb ) ;
955 }
956
957 // u d s k r i v e r f i g B o a r d e t f o r 4x4 p l a d e r
958 p r i v a t e void printFB4x4 ( i n t [ ] [ ] fb ) {
959 System . out . p r i n t l n (” P r i n t FB ”+fb ) ;
960 System . out . p r i n t l n ( fb [ 0 ] [ 0 ] + ” ”+fb [ 1 ] [ 0 ] + ” ”+fb
[ 2 ] [ 0 ] + ” ”+fb [ 3 ] [ 0 ] ) ;
961 System . out . p r i n t l n ( fb [ 0 ] [ 1 ] + ” ”+fb [ 1 ] [ 1 ] + ” ”+fb
[ 2 ] [ 1 ] + ” ”+fb [ 3 ] [ 1 ] ) ;
962 System . out . p r i n t l n ( fb [ 0 ] [ 2 ] + ” ”+fb [ 1 ] [ 2 ] + ” ”+fb
[ 2 ] [ 2 ] + ” ”+fb [ 3 ] [ 2 ] ) ;
963 System . out . p r i n t l n ( fb [ 0 ] [ 3 ] + ” ”+fb [ 1 ] [ 3 ] + ” ”+fb
[ 2 ] [ 3 ] + ” ”+fb [ 3 ] [ 3 ] ) ;
964 System . out . p r i n t l n ( ) ;