Kunstig Intelligens til Brætspillet Taiji - Danmarks Tekniske Universitet

98 Bilag A
120 nodes [ p [ 0 ] ] [ p [ 1 ] ] . add ( n . addChild ( tNode .
createChildNode ( c , r , c , r +1, n ) ) ) ;
121 count++;
122 i n t v = min ( nodes [ p [ 0 ] ] [ p [ 1 ] ] . get ( p [ 2 ] )
, alpha , beta , 0 ) ;
123 i f ( n . a < v )
124 n . a = v ;
125 i f ( n . a > beta ) {
126 b [ c ] [ r ] = 2 ;
127 b [ c ] [ r +1] = 2 ;
128 r e t u r n ( n . a ) ;
129 }
130 i f ( alpha < n . a )
131 alpha = n . a ;
132
133 }
134 b [ c ] [ r ] = 0 ;
135 b [ c ] [ r +1] = 1 ;
136 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 ) ;
137 i f ( p [ 2 ] >= 0) {
138 nodes [ p [ 0 ] ] [ p [ 1 ] ] . get ( p [ 2 ] ) . par . add ( n ) ;
139 n . c h i l d r e n . add ( nodes [ p [ 0 ] ] [ p [ 1 ] ] . get ( p
[ 2 ] ) ) ;
140 i n t v = min ( nodes [ p [ 0 ] ] [ p [ 1 ] ] . get ( p [ 2 ] )
, alpha , beta , 1 ) ;
141 i f ( n . a < v )
142 n . a = v ;
143 i f ( n . a > beta ) {
144 b [ c ] [ r ] = 2 ;
145 b [ c ] [ r +1] = 2 ;
146 r e t u r n ( n . a ) ;
147 }
148 i f ( alpha < n . a )
149 alpha = n . a ;
150 }
151 i f ( p [ 2 ] == −1){
152 p [2]= nodes [ p [ 0 ] ] [ p [ 1 ] ] . s i z e ( ) ;
153 nodes [ p [ 0 ] ] [ p [ 1 ] ] . add ( n . addChild ( tNode .
createChildNode ( c , r +1, c , r , n ) ) ) ;
154 count++;
155 i n t v = min ( nodes [ p [ 0 ] ] [ p [ 1 ] ] . get ( p [ 2 ] )
, alpha , beta , 0 ) ;
156 i f ( n . a < v )
157 n . a = v ;
158 i f ( n . a > beta ) {
159 b [ c ] [ r ] = 2 ;
160 b [ c ] [ r +1] = 2 ;
161 r e t u r n ( n . a ) ;
162 }
163 i f ( alpha < n . a )
164 alpha = n . a ;
165 }
166
167 b [ c ] [ r ] = 2 ;
168 b [ c ] [ r +1] = 2 ;