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
122 Bilag A 729 beta = r e [ 2 ] ; 730 i f ( r e [ 0 ] == 1) { 731 b [ c ] [ r +1] = 2 ; 732 b [ c ] [ r +2] = 2 ; 733 r e t u r n ( r e [ 3 ] ) ; 734 } 735 b [ c ] [ r +1] = 0 ; 736 b [ c ] [ r +2] = 1 ; 737 r e = placePieceMin ( b , d , n , c , r +2, c , r +1, alpha , beta ) ; 738 alpha = r e [ 1 ] ; 739 beta = r e [ 2 ] ; 740 i f ( r e [ 0 ] == 1) { 741 b [ c ] [ r +1] = 2 ; 742 b [ c ] [ r +2] = 2 ; 743 r e t u r n ( r e [ 3 ] ) ; 744 } 745 b [ c ] [ r +1] = 2 ; 746 b [ c ] [ r +2] = 2 ; 747 } 748 } 749 } 750 } 751 // Nord 752 i f ( r > 0) { 753 i f ( fb [ c ] [ r −1] == 0) { 754 i f ( c > 0) { 755 i f ( fb [ c −1][ r −1] == 0) { 756 i n t [ ] r e ; 757 b [ c ] [ r −1] = 1 ; 758 b [ c −1][ r −1] = 0 ; 759 r e = placePieceMin ( b , d , n , c , r −1, c −1, r −1, alpha , beta ) ; 760 alpha = r e [ 1 ] ; 761 beta = r e [ 2 ] ; 762 i f ( r e [ 0 ] == 1) { 763 b [ c ] [ r −1] = 2 ; 764 b [ c −1][ r −1] = 2 ; 765 r e t u r n ( r e [ 3 ] ) ; 766 } 767 b [ c ] [ r −1] = 0 ; 768 b [ c −1][ r −1] = 1 ; 769 r e = placePieceMin ( b , d , n , c −1, r −1, c , r −1, alpha , beta ) ; 770 alpha = r e [ 1 ] ; 771 beta = r e [ 2 ] ; 772 i f ( r e [ 0 ] == 1) { 773 b [ c ] [ r −1] = 2 ; 774 b [ c −1][ r −1] = 2 ; 775 r e t u r n ( r e [ 3 ] ) ; 776 } 777 b [ c ] [ r −1] = 2 ;
A.2 AITaijiGrowth.java 123 778 b [ c −1][ r −1] = 2 ; 779 } 780 } 781 i f ( c < tModel . noCols −1){ 782 i f ( fb [ c +1][ r −1] == 0) { 783 i n t [ ] r e ; 784 b [ c ] [ r −1] = 1 ; 785 b [ c +1][ r −1] = 0 ; 786 r e = placePieceMin ( b , d , n , c , r −1, c +1, r −1, alpha , beta ) ; 787 alpha = r e [ 1 ] ; 788 beta = r e [ 2 ] ; 789 i f ( r e [ 0 ] == 1) { 790 b [ c ] [ r −1] = 2 ; 791 b [ c +1][ r −1] = 2 ; 792 r e t u r n ( r e [ 3 ] ) ; 793 } 794 b [ c ] [ r −1] = 0 ; 795 b [ c +1][ r −1] = 1 ; 796 r e = placePieceMin ( b , d , n , c +1, r −1, c , r −1, alpha , beta ) ; 797 alpha = r e [ 1 ] ; 798 beta = r e [ 2 ] ; 799 i f ( r e [ 0 ] == 1) { 800 b [ c ] [ r −1] = 2 ; 801 b [ c +1][ r −1] = 2 ; 802 r e t u r n ( r e [ 3 ] ) ; 803 } 804 b [ c ] [ r −1] = 2 ; 805 b [ c +1][ r −1] = 2 ; 806 } 807 } 808 i f ( r > 1) { 809 i f ( fb [ c ] [ r −2] == 0) { 810 i n t [ ] r e ; 811 b [ c ] [ r −1] = 1 ; 812 b [ c ] [ r −2] = 0 ; 813 r e = placePieceMin ( b , d , n , c , r −1, c , r −2, alpha , beta ) ; 814 alpha = r e [ 1 ] ; 815 beta = r e [ 2 ] ; 816 i f ( r e [ 0 ] == 1) { 817 b [ c ] [ r −1] = 2 ; 818 b [ c ] [ r −2] = 2 ; 819 r e t u r n ( r e [ 3 ] ) ; 820 } 821 b [ c ] [ r −1] = 0 ; 822 b [ c ] [ r −2] = 1 ; 823 r e = placePieceMin ( b , d , n , c , r −2, c , r −1, alpha , beta ) ; 824 alpha = r e [ 1 ] ;
- Page 82 and 83: 72 Begrænsning af antallet af unde
- Page 84 and 85: 74 Begrænsning af antallet af unde
- Page 86 and 87: 76 Begrænsning af antallet af unde
- Page 88 and 89: 78 Test og sammenligning af de impl
- Page 90 and 91: 80 Test og sammenligning af de impl
- Page 92 and 93: 82 Test og sammenligning af de impl
- Page 94 and 95: 84 Test og sammenligning af de impl
- Page 96 and 97: 86 Test og sammenligning af de impl
- Page 98 and 99: 88 Test og sammenligning af de impl
- Page 100 and 101: 90 Test og sammenligning af de impl
- Page 102 and 103: 92 Konklusion selv n˚a igennem et
- Page 104 and 105: 94 Konklusion
- Page 106 and 107: 96 Bilag A 19 20 // i n i t i a l i
- Page 108 and 109: 98 Bilag A 120 nodes [ p [ 0 ] ] [
- Page 110 and 111: 100 Bilag A 218 i f ( n . a > beta
- Page 112 and 113: 102 Bilag A 319 p [2]= nodes [ p [
- Page 114 and 115: 104 Bilag A 419 420 421 422 423 424
- Page 116 and 117: 106 Bilag A 517 n . wr = tModel . n
- Page 118 and 119: 108 Bilag A 61 } 62 } 63 64 // c h
- Page 120 and 121: 110 Bilag A 155 b [ c +1][ r −1]
- Page 122 and 123: 112 Bilag A 251 b [ c −1][ r −1
- Page 124 and 125: 114 Bilag A 347 r e = placePieceMax
- Page 126 and 127: 116 Bilag A 443 r e = placePieceMax
- Page 128 and 129: 118 Bilag A 537 b [ c +1][ r −1]
- Page 130 and 131: 120 Bilag A 633 b [ c −1][ r −1
- Page 134 and 135: 124 Bilag A 825 beta = r e [ 2 ] ;
- Page 136 and 137: 126 Bilag A 916 i f ( n . a > v ) 9
- Page 138 and 139: 128 Bilag A 997 Root . wc=0; // tMo
- Page 140 and 141: 130 Bilag A 1097 n . bc = tModel .
- Page 142 and 143: 132 Bilag A 93 i f ( rowEnd >= tMod
- Page 144 and 145: 134 Bilag A 192 alpha = n . a ; 193
- Page 146 and 147: 136 Bilag A 291 } 292 293 // Min−
- Page 148 and 149: 138 Bilag A 391 n . c h i l d r e n
- Page 150 and 151: 140 Bilag A 493 i f ( Root . c h i
- 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;
A.2 AI<strong>Taiji</strong>Growth.java 123<br />
778 b [ c −1][ r −1] = 2 ;<br />
779 }<br />
780 }<br />
781 i f ( c < tModel . noCols −1){<br />
782 i f ( fb [ c +1][ r −1] == 0) {<br />
783 i n t [ ] r e ;<br />
784 b [ c ] [ r −1] = 1 ;<br />
785 b [ c +1][ r −1] = 0 ;<br />
786 r e = placePieceMin ( b , d , n ,<br />
c , r −1, c +1, r −1,<br />
alpha , beta ) ;<br />
787 alpha = r e [ 1 ] ;<br />
788 beta = r e [ 2 ] ;<br />
789 i f ( r e [ 0 ] == 1) {<br />
790 b [ c ] [ r −1] = 2 ;<br />
791 b [ c +1][ r −1] = 2 ;<br />
792 r e t u r n ( r e [ 3 ] ) ;<br />
793 }<br />
794 b [ c ] [ r −1] = 0 ;<br />
795 b [ c +1][ r −1] = 1 ;<br />
796 r e = placePieceMin ( b , d , n ,<br />
c +1, r −1, c , r −1,<br />
alpha , beta ) ;<br />
797 alpha = r e [ 1 ] ;<br />
798 beta = r e [ 2 ] ;<br />
799 i f ( r e [ 0 ] == 1) {<br />
800 b [ c ] [ r −1] = 2 ;<br />
801 b [ c +1][ r −1] = 2 ;<br />
802 r e t u r n ( r e [ 3 ] ) ;<br />
803 }<br />
804 b [ c ] [ r −1] = 2 ;<br />
805 b [ c +1][ r −1] = 2 ;<br />
806 }<br />
807 }<br />
808 i f ( r > 1) {<br />
809 i f ( fb [ c ] [ r −2] == 0) {<br />
810 i n t [ ] r e ;<br />
811 b [ c ] [ r −1] = 1 ;<br />
812 b [ c ] [ r −2] = 0 ;<br />
813 r e = placePieceMin ( b , d , n ,<br />
c , r −1, c , r −2, alpha ,<br />
beta ) ;<br />
814 alpha = r e [ 1 ] ;<br />
815 beta = r e [ 2 ] ;<br />
816 i f ( r e [ 0 ] == 1) {<br />
817 b [ c ] [ r −1] = 2 ;<br />
818 b [ c ] [ r −2] = 2 ;<br />
819 r e t u r n ( r e [ 3 ] ) ;<br />
820 }<br />
821 b [ c ] [ r −1] = 0 ;<br />
822 b [ c ] [ r −2] = 1 ;<br />
823 r e = placePieceMin ( b , d , n ,<br />
c , r −2, c , r −1, alpha ,<br />
beta ) ;<br />
824 alpha = r e [ 1 ] ;