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

09.09.2013 Views

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 ;

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

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!