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
158 Bilag A 137 f o r ( i n t r =0; r < tModel . noRows ; r++){ 138 i f ( b [ c ] [ r ] != d [ c ] [ R−r ] ) { 139 br = t r u e ; 140 break ; 141 } 142 } 143 i f ( br ) 144 break ; 145 } 146 i f ( ! br ) 147 r e t u r n ( 2 ) ; 148 149 br = f a l s e ; 150 f o r ( i n t c =0; c < tModel . noCols ; c++){ 151 f o r ( i n t r =0; r < tModel . noRows ; r++){ 152 i f ( b [ c ] [ r ] != d [ C−c ] [ r ] ) { 153 br = t r u e ; 154 break ; 155 } 156 } 157 i f ( br ) 158 break ; 159 } 160 i f ( ! br ) 161 r e t u r n ( 3 ) ; 162 163 br = f a l s e ; 164 f o r ( i n t c =0; c < tModel . noCols ; c++){ 165 f o r ( i n t r =0; r < tModel . noRows ; r++){ 166 i f ( b [ c ] [ r ] != d [ C−c ] [ R−r ] ) { 167 br = t r u e ; 168 break ; 169 } 170 } 171 i f ( br ) 172 break ; 173 } 174 i f ( ! br ) 175 r e t u r n ( 4 ) ; 176 177 i f ( tModel . noCols != tModel . noRows ) // de f o e l g e n d e e r kun mulige hvis , b r a e t t e t e r k v a d r a t i s k 178 r e t u r n ( 0 ) ; 179 180 br = f a l s e ; 181 f o r ( i n t c =0; c < tModel . noCols ; c++){ 182 f o r ( i n t r =0; r < tModel . noRows ; r++){ 183 i f ( b [ c ] [ r ] != d [ r ] [ c ] ) { 184 br = t r u e ; 185 break ; 186 } 187 } 188 i f ( br ) 189 break ; 190 }
A.5 Board.java 159 191 i f ( ! br ) 192 r e t u r n ( 5 ) ; 193 194 br = f a l s e ; 195 f o r ( i n t c =0; c < tModel . noCols ; c++){ 196 f o r ( i n t r =0; r < tModel . noRows ; r++){ 197 i f ( b [ c ] [ r ] != d [R−r ] [ c ] ) { 198 br = t r u e ; 199 break ; 200 } 201 } 202 i f ( br ) 203 break ; 204 } 205 i f ( ! br ) 206 r e t u r n ( 6 ) ; 207 208 br = f a l s e ; 209 f o r ( i n t c =0; c < tModel . noCols ; c++){ 210 f o r ( i n t r =0; r < tModel . noRows ; r++){ 211 i f ( b [ c ] [ r ] != d [ r ] [ C−c ] ) { 212 br = t r u e ; 213 break ; 214 } 215 } 216 i f ( br ) 217 break ; 218 } 219 i f ( ! br ) 220 r e t u r n ( 7 ) ; 221 222 br = f a l s e ; 223 f o r ( i n t c =0; c < tModel . noCols ; c++){ 224 f o r ( i n t r =0; r < tModel . noRows ; r++){ 225 i f ( b [ c ] [ r ] != d [R−r ] [ C−c ] ) { 226 br = t r u e ; 227 break ; 228 } 229 } 230 i f ( br ) 231 break ; 232 } 233 i f ( ! br ) 234 r e t u r n ( 8 ) ; 235 236 r e t u r n ( 0 ) ; 237 } 238 239 // sammenligner to braet , h v i s de e r ens ( r o t t e r e t og/ e l l e r s p e j l v e n d t ) r e t u r n e r e s t r u e 240 p u b l i c boolean compareBoardsBool ( i n t [ ] [ ] b , i n t [ ] [ ] d ) { 241 i n t C = tModel . noCols −1; 242 i n t R = tModel . noRows −1; 243 boolean br = f a l s e ; 244 f o r ( i n t c =0; c < tModel . noCols ; c++){
- 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 132 and 133: 122 Bilag A 729 beta = r e [ 2 ] ;
- 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 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 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
A.5 Board.java 159<br />
191 i f ( ! br )<br />
192 r e t u r n ( 5 ) ;<br />
193<br />
194 br = f a l s e ;<br />
195 f o r ( i n t c =0; c < tModel . noCols ; c++){<br />
196 f o r ( i n t r =0; r < tModel . noRows ; r++){<br />
197 i f ( b [ c ] [ r ] != d [R−r ] [ c ] ) {<br />
198 br = t r u e ;<br />
199 break ;<br />
200 }<br />
201 }<br />
202 i f ( br )<br />
203 break ;<br />
204 }<br />
205 i f ( ! br )<br />
206 r e t u r n ( 6 ) ;<br />
207<br />
208 br = f a l s e ;<br />
209 f o r ( i n t c =0; c < tModel . noCols ; c++){<br />
210 f o r ( i n t r =0; r < tModel . noRows ; r++){<br />
211 i f ( b [ c ] [ r ] != d [ r ] [ C−c ] ) {<br />
212 br = t r u e ;<br />
213 break ;<br />
214 }<br />
215 }<br />
216 i f ( br )<br />
217 break ;<br />
218 }<br />
219 i f ( ! br )<br />
220 r e t u r n ( 7 ) ;<br />
221<br />
222 br = f a l s e ;<br />
223 f o r ( i n t c =0; c < tModel . noCols ; c++){<br />
224 f o r ( i n t r =0; r < tModel . noRows ; r++){<br />
225 i f ( b [ c ] [ r ] != d [R−r ] [ C−c ] ) {<br />
226 br = t r u e ;<br />
227 break ;<br />
228 }<br />
229 }<br />
230 i f ( br )<br />
231 break ;<br />
232 }<br />
233 i f ( ! br )<br />
234 r e t u r n ( 8 ) ;<br />
235<br />
236 r e t u r n ( 0 ) ;<br />
237 }<br />
238<br />
239 // sammenligner to braet , h v i s de e r ens ( r o t t e r e t og/ e l l e r<br />
s p e j l v e n d t ) r e t u r n e r e s t r u e<br />
240 p u b l i c boolean compareBoardsBool ( i n t [ ] [ ] b , i n t [ ] [ ] d ) {<br />
241 i n t C = tModel . noCols −1;<br />
242 i n t R = tModel . noRows −1;<br />
243 boolean br = f a l s e ;<br />
244 f o r ( i n t c =0; c < tModel . noCols ; c++){