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
174 Bilag A 27 whiteScore = new ScorePanel ( t h i s , 1 ) ; 28 b l a c k S c o r e = new ScorePanel ( t h i s , 0 ) ; 29 tPanel = new T a i j i P a n e l ( t h i s ) ; 30 uPanel = new TurnPanel ( t h i s ) ; 31 tMenu = new TaijiMenu ( t h i s ) ; 32 33 getContentPane ( ) . add ( tPanel , ” Center ”) ; 34 getContentPane ( ) . add ( whiteScore , ”West ”) ; 35 getContentPane ( ) . add ( blackScore , ” East ”) ; 36 getContentPane ( ) . add ( uPanel , ” South ”) ; 37 38 t h i s . setJMenuBar ( tMenu ) ; 39 t h i s . s e t D e f a u l t C l o s e O p e r a t i o n ( JFrame . EXIT ON CLOSE) ; 40 t h i s . pack ( ) ; 41 } 42 43 //Metode som r e p a i n t e r a l l e elementerne i framen . 44 p u b l i c void r e p a i n t A l l ( ) 45 { 46 t h i s . tPanel . r e p a i n t ( ) ; 47 t h i s . whiteScore . r e p a i n t ( ) ; 48 t h i s . b l a c k S c o r e . r e p a i n t ( ) ; 49 t h i s . uPanel . update ( ) ; 50 } 51 52 // Goer TaijiFrame s y n l i g r e n t g r a f i s k . 53 p u b l i c void showIt ( ) 54 { 55 s e t V i s i b l e ( t r u e ) ; 56 } 57 58 // S k j u l e r TaijiFrame ( b l i v e r i k k e brugt ) 59 p u b l i c void h i d e I t ( ) 60 { 61 s e t V i s i b l e ( f a l s e ) ; 62 } 63 64 } A.10 TaijiHash.java 1 2 p u b l i c c l a s s TaijiHash { 3 p r i v a t e TaijiModel tModel ; 4 p r i v a t e i n t [ ] [ ] valueBoard ; // valueBoard , b r a e t t e t med symmetrisk ens v a e r d i e r 5 6 7 p u b l i c TaijiHash ( TaijiModel m) 8 { 9 tModel = m; 10 valueBoard = new i n t [ tModel . noCols ] [ tModel . noRows ] ; 11 f o r ( i n t i = 0 ; i
A.10 TaijiHash.java 175 12 f o r ( i n t j = 0 ; j=tModel . noCols /2) 51 bc = 1 ; 52 e l s e 53 bc = 0 ; 54 55 i f ( tModel . noRows%2==0 && r>=tModel . noRows /2) 56 br = 1 ; 57 e l s e 58 br = 0 ; 59 60 v = ( v + ( ( ( Math . abs ( tModel . noCols/2−c )+bc ) ∗ ( Math . abs ( tModel . noRows/2−r )+br ) ) /2) )%maxV ; 61 } 62 63 i f ( b [ c ] [ r ] == 1) { 64 i f ( tModel . noCols%2==0 && c>=tModel . noCols /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 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 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 218 and 219: 208 Bilag A [ 1 ] [ 7 ] + ” ”+n
- 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
A.10 <strong>Taiji</strong>Hash.java 175<br />
12 f o r ( i n t j = 0 ; j=tModel . noCols /2)<br />
51 bc = 1 ;<br />
52 e l s e<br />
53 bc = 0 ;<br />
54<br />
55 i f ( tModel . noRows%2==0 && r>=tModel . noRows /2)<br />
56 br = 1 ;<br />
57 e l s e<br />
58 br = 0 ;<br />
59<br />
60 v = ( v + ( ( ( Math . abs ( tModel . noCols/2−c )+bc ) ∗ (<br />
Math . abs ( tModel . noRows/2−r )+br ) ) /2) )%maxV ;<br />
61 }<br />
62<br />
63 i f ( b [ c ] [ r ] == 1) {<br />
64 i f ( tModel . noCols%2==0 && c>=tModel . noCols /2)
Change language