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

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

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

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

Saved successfully!

Ooh no, something went wrong!