Kunstig Intelligens til Brætspillet Taiji - Danmarks Tekniske Universitet

112 Bilag A
251 b [ c −1][ r −1] = 2 ;
252 }
253 }
254 i f ( c > 1) {
255 i f ( fb [ c −2][ r ] == 0) {
256 i n t [ ] r e ;
257 b [ c −1][ r ] = 1 ;
258 b [ c −2][ r ] = 0 ;
259 r e = placePieceMax ( b , d , n ,
c −1, r , c −2, r , alpha ,
beta ) ;
260 alpha = r e [ 1 ] ;
261 beta = r e [ 2 ] ;
262 i f ( r e [ 0 ] == 1) {
263 b [ c −1][ r ] = 2 ;
264 b [ c −2][ r ] = 2 ;
265 r e t u r n ( r e [ 3 ] ) ;
266 }
267 b [ c −1][ r ] = 0 ;
268 b [ c −2][ r ] = 1 ;
269 r e = placePieceMax ( b , d , n ,
c −2, r , c −1, r , alpha ,
beta ) ;
270 alpha = r e [ 1 ] ;
271 beta = r e [ 2 ] ;
272 i f ( r e [ 0 ] == 1) {
273 b [ c −1][ r ] = 2 ;
274 b [ c −2][ r ] = 2 ;
275 r e t u r n ( r e [ 3 ] ) ;
276 }
277 b [ c −1][ r ] = 2 ;
278 b [ c −2][ r ] = 2 ;
279 }
280 }
281 }
282 }
283 // System . out . p r i n t l n (” Growth count so f a r
”+count+” d=”+n . d ) ;
284 // printFB ( fb ) ;
285 // syd
286 i f ( r < tModel . noRows−1){
287 i f ( fb [ c ] [ r +1] == 0) {
288 i f ( c < tModel . noCols −1){
289 i f ( fb [ c +1][ r +1] == 0) {
290 i n t [ ] r e ;
291 b [ c ] [ r +1] = 1 ;
292 b [ c +1][ r +1] = 0 ;
293 r e = placePieceMax ( b , d , n ,
c , r +1, c +1, r +1,
alpha , beta ) ;
294 alpha = r e [ 1 ] ;
295 beta = r e [ 2 ] ;
296 i f ( r e [ 0 ] == 1) {
297 b [ c ] [ r +1] = 2 ;
298 b [ c +1][ r +1] = 2 ;