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
192 Bilag A 416 { 417 //Bunden 418 i f ( ( curCol > 0) && ( curCol < noCols −1) && ( curRow == noRows−1) ) 419 { 420 i f ( checkBottom ( b , curCol , curRow ) ) 421 { 422 r e s u l t = t r u e ; 423 } 424 r e t u r n ( r e s u l t ) ; 425 } 426 e l s e 427 { 428 // o e v e r s t e v e n s t r e h j o e r n e 429 i f ( curCol == 0 && curRow == 0) 430 { 431 i f ( checkTLC ( b , curCol , curRow ) ) 432 { 433 r e s u l t = t r u e ; 434 } 435 r e t u r n ( r e s u l t ) ; 436 } 437 e l s e 438 { 439 // o e v e r s t e h o e j r e h j o e r n e 440 i f ( curCol == noCols −1 && curRow == 0) 441 { 442 i f ( checkTRC ( b , curCol , curRow ) ) 443 { 444 r e s u l t = t r u e ; 445 } 446 r e t u r n ( r e s u l t ) ; 447 } 448 e l s e 449 { 450 // Nederste v e n s t r e h j o e r n e 451 i f ( curCol == 0 && curRow == noRows−1) 452 { 453 i f ( checkBLC ( b , curCol , curRow ) ) 454 { 455 r e s u l t = t r u e ; 456 } 457 r e t u r n ( r e s u l t ) ; 458 } 459 e l s e 460 { 461 // Nederste h o e j r e h j o e r n e 462 i f ( curCol == noCols −1 && curRow == noRows−1) 463 {
A.13 TaijiModel.java 193 464 i f ( checkBRC ( b , curCol , curRow ) ) 465 { 466 r e s u l t = t r u e ; 467 } 468 r e t u r n ( r e s u l t ) ; 469 } 470 } 471 } 472 } 473 } 474 } 475 } 476 } 477 } 478 } 479 e l s e 480 // check f o r andet k l i k ( p l a c e r i n g e n a f den s o r t e d e l a f brikken ) 481 i f ( ( b [ curCol ] [ curRow ] == 2) && ( ( ( curCol == preCol +1) && ( curRow == preRow ) ) | | ( ( curCol == preCol −1) && ( curRow == preRow ) ) | | ( ( curCol == preCol ) && ( curRow == preRow+1) ) | | ( ( curCol == preCol ) && ( curRow == preRow −1) ) ) ) 482 { 483 r e s u l t = t r u e ; 484 r e t u r n ( r e s u l t ) ; 485 } 486 r e t u r n ( r e s u l t ) ; 487 } 488 489 // anvendes i checkMove 490 p r i v a t e boolean checkMidle ( i n t [ ] [ ] b , i n t Col , i n t Row) 491 { 492 i f ( ( b [ Col ] [ Row ] == 2) && ( ( ( b [ Col ] [ Row+1] == 2 ) | | ( b [ Col ] [ Row−1] == 2 ) | | ( b [ Col +1][Row ] == 2 ) | | ( b [ Col −1][Row ] == 2 ) ) ) ) 493 { 494 r e t u r n ( t r u e ) ; 495 } 496 r e t u r n ( f a l s e ) ; 497 } 498 499 // anvendes i checkMove 500 p r i v a t e boolean c h e c k L e f t ( i n t [ ] [ ] b , i n t Col , i n t Row) 501 { 502 i f ( ( b [ Col ] [ Row ] == 2) && ( ( ( b [ Col ] [ Row+1] == 2 ) | | ( b [ Col ] [ Row−1] == 2 ) | | ( b [ Col +1][Row ] == 2 ) ) ) ) 503 { 504 r e t u r n ( t r u e ) ; 505 } 506 r e t u r n ( f a l s e ) ; 507 } 508 509 // anvendes i checkMove
- Page 152 and 153: 142 Bilag A 593 r e t u r n ( n ) ;
- 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 204 and 205: 194 Bilag A 510 p r i v a t e boole
- 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
A.13 <strong>Taiji</strong>Model.java 193<br />
464 i f ( checkBRC ( b , curCol ,<br />
curRow ) )<br />
465 {<br />
466 r e s u l t = t r u e ;<br />
467 }<br />
468 r e t u r n ( r e s u l t ) ;<br />
469 }<br />
470 }<br />
471 }<br />
472 }<br />
473 }<br />
474 }<br />
475 }<br />
476 }<br />
477 }<br />
478 }<br />
479 e l s e<br />
480 // check f o r andet k l i k ( p l a c e r i n g e n a f den s o r t e d e l a f<br />
brikken )<br />
481 i f ( ( b [ curCol ] [ curRow ] == 2) && ( ( ( curCol == preCol +1) && (<br />
curRow == preRow ) ) | | ( ( curCol == preCol −1) && ( curRow<br />
== preRow ) ) | | ( ( curCol == preCol ) && ( curRow ==<br />
preRow+1) ) | | ( ( curCol == preCol ) && ( curRow == preRow<br />
−1) ) ) )<br />
482 {<br />
483 r e s u l t = t r u e ;<br />
484 r e t u r n ( r e s u l t ) ;<br />
485 }<br />
486 r e t u r n ( r e s u l t ) ;<br />
487 }<br />
488<br />
489 // anvendes i checkMove<br />
490 p r i v a t e boolean checkMidle ( i n t [ ] [ ] b , i n t Col , i n t Row)<br />
491 {<br />
492 i f ( ( b [ Col ] [ Row ] == 2) && ( ( ( b [ Col ] [ Row+1] == 2 ) | | ( b [ Col ] [<br />
Row−1] == 2 ) | | ( b [ Col +1][Row ] == 2 ) | | ( b [ Col −1][Row ] ==<br />
2 ) ) ) )<br />
493 {<br />
494 r e t u r n ( t r u e ) ;<br />
495 }<br />
496 r e t u r n ( f a l s e ) ;<br />
497 }<br />
498<br />
499 // anvendes i checkMove<br />
500 p r i v a t e boolean c h e c k L e f t ( i n t [ ] [ ] b , i n t Col , i n t Row)<br />
501 {<br />
502 i f ( ( b [ Col ] [ Row ] == 2) && ( ( ( b [ Col ] [ Row+1] == 2 ) | | ( b [ Col ] [<br />
Row−1] == 2 ) | | ( b [ Col +1][Row ] == 2 ) ) ) )<br />
503 {<br />
504 r e t u r n ( t r u e ) ;<br />
505 }<br />
506 r e t u r n ( f a l s e ) ;<br />
507 }<br />
508<br />
509 // anvendes i checkMove