Kunstig Intelligens til Brætspillet Taiji - Danmarks Tekniske Universitet
Kunstig Intelligens til Brætspillet Taiji - Danmarks Tekniske Universitet Kunstig Intelligens til Brætspillet Taiji - Danmarks Tekniske Universitet
194 Bilag A 510 p r i v a t e boolean checkRight ( i n t [ ] [ ] b , i n t Col , i n t Row) 511 { 512 i f ( ( b [ Col ] [ Row ] == 2) && ( ( ( b [ Col ] [ Row+1] == 2 ) | | ( b [ Col ] [ Row−1] == 2 ) | | ( b [ Col −1][Row ] == 2 ) ) ) ) 513 { 514 r e t u r n ( t r u e ) ; 515 } 516 r e t u r n ( f a l s e ) ; 517 } 518 519 // anvendes i checkMove 520 p r i v a t e boolean checkTop ( i n t [ ] [ ] b , i n t Col , i n t Row) 521 { 522 i f ( ( b [ Col ] [ Row ] == 2) && ( ( ( b [ Col ] [ Row+1] == 2 ) | | ( b [ Col +1][Row ] == 2 ) | | ( b [ Col −1][Row ] == 2 ) ) ) ) 523 { 524 r e t u r n ( t r u e ) ; 525 } 526 r e t u r n ( f a l s e ) ; 527 } 528 529 // anvendes i checkMove 530 p r i v a t e boolean checkBottom ( i n t [ ] [ ] b , i n t Col , i n t Row) 531 { 532 i f ( ( b [ Col ] [ Row ] == 2) && ( ( ( b [ Col ] [ Row−1] == 2 ) | | ( b [ Col +1][Row ] == 2 ) | | ( b [ Col −1][Row ] == 2 ) ) ) ) 533 { 534 r e t u r n ( t r u e ) ; 535 } 536 r e t u r n ( f a l s e ) ; 537 } 538 539 // anvendes i checkMove 540 p r i v a t e boolean checkTLC ( i n t [ ] [ ] b , i n t Col , i n t Row) 541 { 542 i f ( ( b [ Col ] [ Row ] == 2) && ( ( ( b [ Col ] [ Row+1] == 2 ) | | ( b [ Col +1][Row ] == 2 ) ) ) ) 543 { 544 r e t u r n ( t r u e ) ; 545 } 546 r e t u r n ( f a l s e ) ; 547 } 548 549 // anvendes i checkMove 550 p r i v a t e boolean checkTRC ( i n t [ ] [ ] b , i n t Col , i n t Row) 551 { 552 i f ( ( b [ Col ] [ Row ] == 2) && ( ( ( b [ Col ] [ Row+1] == 2 ) | | ( b [ Col −1][Row ] == 2 ) ) ) ) 553 { 554 r e t u r n ( t r u e ) ; 555 } 556 r e t u r n ( f a l s e ) ; 557 } 558 559 // anvendes i checkMove
A.13 TaijiModel.java 195 560 p r i v a t e boolean checkBLC ( i n t [ ] [ ] b , i n t Col , i n t Row) 561 { 562 i f ( ( b [ Col ] [ Row ] == 2) && ( ( ( b [ Col ] [ Row−1] == 2 ) | | ( b [ Col +1][Row ] == 2 ) ) ) ) 563 { 564 r e t u r n ( t r u e ) ; 565 } 566 r e t u r n ( f a l s e ) ; 567 } 568 569 // anvendes i checkMove 570 p r i v a t e boolean checkBRC ( i n t [ ] [ ] b , i n t Col , i n t Row) 571 { 572 i f ( ( b [ Col ] [ Row ] == 2) && ( ( ( b [ Col ] [ Row−1] == 2 ) | | ( b [ Col −1][Row ] == 2 ) ) ) ) 573 { 574 r e t u r n ( t r u e ) ; 575 } 576 r e t u r n ( f a l s e ) ; 577 } 578 579 580 581 582 583 584 // Undersoeger om der e r en vinder , i den nuvaerende tur . 585 p r i v a t e i n t gameOver ( ) 586 { 587 i f ( fMap == n u l l ) 588 System . out . p r i n t l n (” Null ”) ; 589 i n t [ ] s ; 590 s = new i n t [ 2 ] ; 591 s = fMap . c a l S c o r e ( tBoard . board [ currentTurn ] , noCols , noRows ) ; 592 whScore = s [ 0 ] ; 593 b l S c o r e = s [ 1 ] ; 594 i n t winner= −1; 595 i f ( movesLeft ( ) == f a l s e && c l i c k == f a l s e ) 596 { 597 i f ( whScore > b l S c o r e ) 598 { 599 winner = 1 ; 600 } 601 i f ( b l S c o r e > whScore ) 602 { 603 winner = 0 ; 604 } 605 i f ( b l S c o r e == whScore ) 606 { 607 winner = 2 ; 608 } 609 } 610 611 r e t u r n winner ;
- Page 154 and 155: 144 Bilag A 90 b [ c ] [ r ] = 0 ;
- Page 156 and 157: 146 Bilag A 185 // System . out . p
- Page 158 and 159: 148 Bilag A 280 } 281 282 // f l y
- Page 160 and 161: 150 Bilag A 377 // i f ( tTree . ma
- Page 162 and 163: 152 Bilag A 481 } 482 r e t u r n (
- Page 164 and 165: 154 Bilag A 532 // System . out . p
- Page 166 and 167: 156 Bilag A 33 p u b l i c i n t [
- Page 168 and 169: 158 Bilag A 137 f o r ( i n t r =0;
- Page 170 and 171: 160 Bilag A 245 f o r ( i n t r =0;
- Page 172 and 173: 162 Bilag A 353 break ; 354 } 355 i
- Page 174 and 175: 164 Bilag A 94 } 95 { // H o r i s
- Page 176 and 177: 166 Bilag A 198 p r i v a t e void
- Page 178 and 179: 168 Bilag A 303 f [ 1 ] [ 0 ] [ 1 ]
- Page 180 and 181: 170 Bilag A 409 f o r ( i n t r =0;
- Page 182 and 183: 172 Bilag A 43 p u b l i c Node cre
- Page 184 and 185: 174 Bilag A 27 whiteScore = new Sco
- Page 186 and 187: 176 Bilag A 65 bc = 1 ; 66 e l s e
- Page 188 and 189: 178 Bilag A 58 p u b l i c void mou
- Page 190 and 191: 180 Bilag A 149 S t r i n g t x t =
- Page 192 and 193: 182 Bilag A l o a d i n g the f i l
- Page 194 and 195: 184 Bilag A 7 p u b l i c AITaijiMi
- Page 196 and 197: 186 Bilag A 105 i f ( b l a c k P l
- Page 198 and 199: 188 Bilag A 211 tBoard . s e t P i
- Page 200 and 201: 190 Bilag A 315 { 316 f o r ( i n t
- Page 202 and 203: 192 Bilag A 416 { 417 //Bunden 418
- Page 206 and 207: 196 Bilag A 612 } 613 614 // b e r
- Page 208 and 209: 198 Bilag A 702 } 703 704 // s a e
- Page 210 and 211: 200 Bilag A 802 p u b l i c void ne
- Page 212 and 213: 202 Bilag A 59 g . f i l l R e c t
- Page 214 and 215: 204 Bilag A 159 { 160 t h i s . set
- Page 216 and 217: 206 Bilag A 81 System . out . p r i
- Page 218 and 219: 208 Bilag A [ 1 ] [ 7 ] + ” ”+n
- Page 220 and 221: 210 Bilag A 176 System . out . p r
- Page 222 and 223: 212 Bilag A 212 System . out . p r
- Page 224 and 225: 214 Bilag A 246 System . out . p r
- Page 226 and 227: 216 Bilag A [ 8 ] [ 2 ] ) ; 277 i f
- Page 228 and 229: 218 Bilag A 326 p u b l i c void pr
- Page 230 and 231: 220 Bilag A 393 i f ( tModel . noRo
- Page 232 and 233: 222 Bilag A 449 i f ( tModel . noRo
- Page 234 and 235: 224 Bilag A 501 System . out . p r
- Page 236 and 237: 226 Bilag A 30 31 tFrame = frame ;
- Page 238 and 239: 228 Bilag A 135 tFrame . tModel . s
- Page 240 and 241: 230
- Page 242 and 243: 232 Bilag B ”Introduction to Algo
- Page 244: 234
194 Bilag A<br />
510 p r i v a t e boolean checkRight ( i n t [ ] [ ] b , i n t Col , i n t Row)<br />
511 {<br />
512 i f ( ( b [ Col ] [ Row ] == 2) && ( ( ( b [ Col ] [ Row+1] == 2 ) | | ( b [ Col<br />
] [ Row−1] == 2 ) | | ( b [ Col −1][Row ] == 2 ) ) ) )<br />
513 {<br />
514 r e t u r n ( t r u e ) ;<br />
515 }<br />
516 r e t u r n ( f a l s e ) ;<br />
517 }<br />
518<br />
519 // anvendes i checkMove<br />
520 p r i v a t e boolean checkTop ( i n t [ ] [ ] b , i n t Col , i n t Row)<br />
521 {<br />
522 i f ( ( b [ Col ] [ Row ] == 2) && ( ( ( b [ Col ] [ Row+1] == 2 ) | | ( b [ Col<br />
+1][Row ] == 2 ) | | ( b [ Col −1][Row ] == 2 ) ) ) )<br />
523 {<br />
524 r e t u r n ( t r u e ) ;<br />
525 }<br />
526 r e t u r n ( f a l s e ) ;<br />
527 }<br />
528<br />
529 // anvendes i checkMove<br />
530 p r i v a t e boolean checkBottom ( i n t [ ] [ ] b , i n t Col , i n t Row)<br />
531 {<br />
532 i f ( ( b [ Col ] [ Row ] == 2) && ( ( ( b [ Col ] [ Row−1] == 2 ) | | ( b [ Col<br />
+1][Row ] == 2 ) | | ( b [ Col −1][Row ] == 2 ) ) ) )<br />
533 {<br />
534 r e t u r n ( t r u e ) ;<br />
535 }<br />
536 r e t u r n ( f a l s e ) ;<br />
537 }<br />
538<br />
539 // anvendes i checkMove<br />
540 p r i v a t e boolean checkTLC ( i n t [ ] [ ] b , i n t Col , i n t Row)<br />
541 {<br />
542 i f ( ( b [ Col ] [ Row ] == 2) && ( ( ( b [ Col ] [ Row+1] == 2 ) | | ( b [ Col<br />
+1][Row ] == 2 ) ) ) )<br />
543 {<br />
544 r e t u r n ( t r u e ) ;<br />
545 }<br />
546 r e t u r n ( f a l s e ) ;<br />
547 }<br />
548<br />
549 // anvendes i checkMove<br />
550 p r i v a t e boolean checkTRC ( i n t [ ] [ ] b , i n t Col , i n t Row)<br />
551 {<br />
552 i f ( ( b [ Col ] [ Row ] == 2) && ( ( ( b [ Col ] [ Row+1] == 2 ) | | ( b [ Col<br />
−1][Row ] == 2 ) ) ) )<br />
553 {<br />
554 r e t u r n ( t r u e ) ;<br />
555 }<br />
556 r e t u r n ( f a l s e ) ;<br />
557 }<br />
558<br />
559 // anvendes i checkMove