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
208 Bilag A [ 1 ] [ 7 ] + ” ”+n . c h i l d r e n . get ( i ) . nodeBoard [ 2 ] [ 7 ] + ” ”+n . c h i l d r e n . get ( i ) . nodeBoard [ 3 ] [ 7 ] ) ; 127 i f ( tModel . noRows > 8) { 128 System . out . p r i n t l n ( n . c h i l d r e n . get ( i ) . nodeBoard [ 0 ] [ 8 ] + ” ”+ n . c h i l d r e n . get ( i ) . nodeBoard [ 1 ] [ 8 ] + ” ”+n . c h i l d r e n . get ( i ) . nodeBoard [ 2 ] [ 8 ] + ” ”+n . c h i l d r e n . get ( i ) . nodeBoard [ 3 ] [ 8 ] ) ; 129 130 } 131 } 132 } 133 } 134 } 135 } 136 System . out . p r i n t l n ( ) ; 137 } 138 } 139 140 // f o r b r a e t med 5 k o l o n e r 141 p u b l i c void p r i n t C h i l d r e n 5 x ( Node n ) { 142 System . out . p r i n t l n (” t P r i n t P r i n t Children ”+n ) ; 143 f o r ( i n t i =0; i 3) { 150 System . out . p r i n t l n ( n . c h i l d r e n . get ( i ) . nodeBoard [ 0 ] [ 3 ] + ” ”+n . c h i l d r e n . get ( i ) . nodeBoard [ 1 ] [ 3 ] + ” ”+n . c h i l d r e n . get ( i ) . nodeBoard [ 2 ] [ 3 ] + ” ”+n . c h i l d r e n . get ( i ) . nodeBoard [ 3 ] [ 3 ] + ” ”+n . c h i l d r e n . get ( i ) . nodeBoard [ 4 ] [ 3 ] ) ; 151 i f ( tModel . noRows > 4) {
A.15 TaijiPrint.java 209 152 System . out . p r i n t l n ( n . c h i l d r e n . get ( i ) . nodeBoard [ 0 ] [ 4 ] + ” ”+n . c h i l d r e n . get ( i ) . nodeBoard [ 1 ] [ 4 ] + ” ”+n . c h i l d r e n . get ( i ) . nodeBoard [ 2 ] [ 4 ] + ” ”+n . c h i l d r e n . get ( i ) . nodeBoard [ 3 ] [ 4 ] + ” ”+n . c h i l d r e n . get ( i ) . nodeBoard [ 4 ] [ 4 ] ) ; 153 i f ( tModel . noRows > 5) { 154 System . out . p r i n t l n ( n . c h i l d r e n . get ( i ) . nodeBoard [ 0 ] [ 5 ] + ” ”+n . c h i l d r e n . get ( i ) . nodeBoard [ 1 ] [ 5 ] + ” ”+n . c h i l d r e n . get ( i ) . nodeBoard [ 2 ] [ 5 ] + ” ”+n . c h i l d r e n . get ( i ) . nodeBoard [ 3 ] [ 5 ] + ” ”+n . c h i l d r e n . get ( i ) . nodeBoard [ 4 ] [ 5 ] ) ; 155 i f ( tModel . noRows > 6) { 156 System . out . p r i n t l n ( n . c h i l d r e n . get ( i ) . nodeBoard [ 0 ] [ 6 ] + ” ”+n . c h i l d r e n . get ( i ) . nodeBoard [ 1 ] [ 6 ] + ” ”+n . c h i l d r e n . get ( i ) . nodeBoard [ 2 ] [ 6 ] + ” ”+n . c h i l d r e n . get ( i ) . nodeBoard [ 3 ] [ 6 ] + ” ”+n . c h i l d r e n . get ( i ) . nodeBoard [ 4 ] [ 6 ] ) ; 157 i f ( tModel . noRows > 7) { 158 System . out . p r i n t l n ( n . c h i l d r e n . get ( i ) . nodeBoard [ 0 ] [ 7 ] + ” ”+n . c h i l d r e n . get ( i ) . nodeBoard [ 1 ] [ 7 ] + ” ”+n . c h i l d r e n . get ( i ) . nodeBoard [ 2 ] [ 7 ] + ” ”+n . c h i l d r e n . get ( i ) . nodeBoard [ 3 ] [ 7 ] + ” ”+n . c h i l d r e n . get ( i ) . nodeBoard [ 4 ] [ 7 ] ) ; 159 i f ( tModel . noRows > 8) { 160 System . out . p r i n t l n ( n . c h i l d r e n . get ( i ) . nodeBoard [ 0 ] [ 8 ] + ” ”+ n . c h i l d r e n . get ( i ) . nodeBoard [ 1 ] [ 8 ] + ” ”+n . c h i l d r e n . get ( i ) . nodeBoard [ 2 ] [ 8 ] + ” ”+n . c h i l d r e n . get ( i ) . nodeBoard [ 3 ] [ 8 ] + ” ”+n . c h i l d r e n . get ( i ) . nodeBoard [ 4 ] [ 8 ] ) ; 161 162 } 163 } 164 } 165 } 166 } 167 } 168 System . out . p r i n t l n ( ) ; 169 } 170 } 171 172 // f o r b r a e t med 6 k o l o n e r 173 p u b l i c void p r i n t C h i l d r e n 6 x ( Node n ) { 174 System . out . p r i n t l n (” t P r i n t P r i n t Children ”+n ) ; 175 f o r ( i n t i =0; i
- 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 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
- 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.15 <strong>Taiji</strong>Print.java 209<br />
152 System . out . p r i n t l n ( n . c h i l d r e n . get ( i ) . nodeBoard<br />
[ 0 ] [ 4 ] + ” ”+n . c h i l d r e n . get ( i ) . nodeBoard<br />
[ 1 ] [ 4 ] + ” ”+n . c h i l d r e n . get ( i ) . nodeBoard<br />
[ 2 ] [ 4 ] + ” ”+n . c h i l d r e n . get ( i ) . nodeBoard<br />
[ 3 ] [ 4 ] + ” ”+n . c h i l d r e n . get ( i ) . nodeBoard<br />
[ 4 ] [ 4 ] ) ;<br />
153 i f ( tModel . noRows > 5) {<br />
154 System . out . p r i n t l n ( n . c h i l d r e n . get ( i ) .<br />
nodeBoard [ 0 ] [ 5 ] + ” ”+n . c h i l d r e n . get ( i ) .<br />
nodeBoard [ 1 ] [ 5 ] + ” ”+n . c h i l d r e n . get ( i ) .<br />
nodeBoard [ 2 ] [ 5 ] + ” ”+n . c h i l d r e n . get ( i ) .<br />
nodeBoard [ 3 ] [ 5 ] + ” ”+n . c h i l d r e n . get ( i ) .<br />
nodeBoard [ 4 ] [ 5 ] ) ;<br />
155 i f ( tModel . noRows > 6) {<br />
156 System . out . p r i n t l n ( n . c h i l d r e n . get ( i ) .<br />
nodeBoard [ 0 ] [ 6 ] + ” ”+n . c h i l d r e n . get (<br />
i ) . nodeBoard [ 1 ] [ 6 ] + ” ”+n . c h i l d r e n .<br />
get ( i ) . nodeBoard [ 2 ] [ 6 ] + ” ”+n .<br />
c h i l d r e n . get ( i ) . nodeBoard [ 3 ] [ 6 ] + ”<br />
”+n . c h i l d r e n . get ( i ) . nodeBoard<br />
[ 4 ] [ 6 ] ) ;<br />
157 i f ( tModel . noRows > 7) {<br />
158 System . out . p r i n t l n ( n . c h i l d r e n . get ( i<br />
) . nodeBoard [ 0 ] [ 7 ] + ” ”+n .<br />
c h i l d r e n . get ( i ) . nodeBoard<br />
[ 1 ] [ 7 ] + ” ”+n . c h i l d r e n . get ( i ) .<br />
nodeBoard [ 2 ] [ 7 ] + ” ”+n . c h i l d r e n .<br />
get ( i ) . nodeBoard [ 3 ] [ 7 ] + ” ”+n .<br />
c h i l d r e n . get ( i ) . nodeBoard<br />
[ 4 ] [ 7 ] ) ;<br />
159 i f ( tModel . noRows > 8) {<br />
160 System . out . p r i n t l n ( n . c h i l d r e n .<br />
get ( i ) . nodeBoard [ 0 ] [ 8 ] + ” ”+<br />
n . c h i l d r e n . get ( i ) . nodeBoard<br />
[ 1 ] [ 8 ] + ” ”+n . c h i l d r e n . get ( i<br />
) . nodeBoard [ 2 ] [ 8 ] + ” ”+n .<br />
c h i l d r e n . get ( i ) . nodeBoard<br />
[ 3 ] [ 8 ] + ” ”+n . c h i l d r e n . get ( i<br />
) . nodeBoard [ 4 ] [ 8 ] ) ;<br />
161<br />
162 }<br />
163 }<br />
164 }<br />
165 }<br />
166 }<br />
167 }<br />
168 System . out . p r i n t l n ( ) ;<br />
169 }<br />
170 }<br />
171<br />
172 // f o r b r a e t med 6 k o l o n e r<br />
173 p u b l i c void p r i n t C h i l d r e n 6 x ( Node n ) {<br />
174 System . out . p r i n t l n (” t P r i n t P r i n t Children ”+n ) ;<br />
175 f o r ( i n t i =0; i
Change language