Kunstig Intelligens til Brætspillet Taiji - Danmarks Tekniske Universitet

A.13 TaijiModel.java 189
264 Date time2 = new Date ( ) ;
265 long t2 = time2 . getTime ( ) ;
266 long t3 = t2−t1 ;
267 System . out . p r i n t l n (”TM − growthTurn time : ”+t3 ) ;
268 }
269
270 // f o r e t a g e r e t t r a e k ved h j a e l p a f LocalArea AI ’ en .
271 // b = t r u e h v i s den s k a l s p i l l e s o r t , f a l s e f o r hvid
272 p r i v a t e void localAreaABTurn ( boolean b ) {
273 Date time = new Date ( ) ;
274 long t1 = time . getTime ( ) ;
275 Node n ;
276 n = localAreaAB . returnMove ( b ) ;
277 tBoard . copyBoard ( ) ;
278 currentTurn++;
279 tBoard . board [ 0 ] [ 0 ] [ 0 ] = currentTurn ;
280 showTurn++;
281 tBoard . s e t P i e c e ( n . wc , n . wr , white ) ;
282 tBoard . s e t P i e c e ( n . bc , n . br , black ) ;
283 Date time2 = new Date ( ) ;
284 long t2 = time2 . getTime ( ) ;
285 long t3 = t2−t1 ;
286 System . out . p r i n t l n (”TM − LAABTurn time : ”+t3 ) ;
287 }
288
289 // Bestemmer om der e r n o g l e l o v l i g e ryk t i l b a g e .
290 p u b l i c boolean movesLeft ( )
291 {
292 f o r ( i n t c =0; c < noCols ; c++)
293 {
294 f o r ( i n t r =0; r < noRows−1; r++)
295 {
296 i f ( tBoard . board [ currentTurn ] [ c ] [ r ] == 2 &&
tBoard . board [ currentTurn ] [ c ] [ r +1] == 2
)
297 r e t u r n ( t r u e ) ;
298 }
299 }
300 f o r ( i n t c =0; c < noCols −1; c++)
301 {
302 f o r ( i n t r =0; r < noRows ; r++)
303 {
304 i f ( tBoard . board [ currentTurn ] [ c ] [ r ] == 2 &&
tBoard . board [ currentTurn ] [ c +1][ r ] == 2
)
305 r e t u r n ( t r u e ) ;
306 }
307 }
308 r e t u r n ( f a l s e ) ;
309 }
310
311 // Bestemmer om der e r n o g l e l o v l i g e ryk t i l b a g e f o r Noden n .
312 p u b l i c boolean movesLeftN ( Node n )
313 {
314 f o r ( i n t c =0; c < noCols ; c++)