Kunstig Intelligens til Brætspillet Taiji - Danmarks Tekniske Universitet

228 Bilag A
135 tFrame . tModel . s e t S t a r t e r ( 1 ) ;
136 tFrame . tModel . setWhitePlayer ( 2 ) ;
137 tFrame . tModel . s e t B l a c k P l a y e r ( 0 ) ;
138 }
139 i f ( s e t == 7) { // Growth VS Player
140 tFrame . tModel . s e t S t a r t e r ( 1 ) ;
141 tFrame . tModel . setWhitePlayer ( 4 ) ;
142 tFrame . tModel . s e t B l a c k P l a y e r ( 0 ) ;
143 }
144 tFrame . tModel . r e s e t ( ) ;
145 tFrame . r e p a i n t A l l ( ) ;
146 s e t V i s i b l e ( f a l s e ) ;
147 }
148 e l s e
149 {
150 s e t V i s i b l e ( f a l s e ) ;
151 }
152 }
153 }
154 }
A.17 Tree.java
1 import java . u t i l . ArrayList ;
2 p u b l i c c l a s s Tree { // denne k l a s s e e r kun anvendt i Minimax AI ’ en
3 p u b l i c Node Root ;
4 p u b l i c Node Cur ; // c u r r e n t node
5 p u b l i c ArrayList evenGen ;
6 p u b l i c ArrayList oddGen ;
7 p u b l i c ArrayList Leaves ;
8 p u b l i c i n t curLeaves ; // Current number o f l e a v e s
9 p u b l i c i n t t o t a l L e a v e s ; // Temperary number o f l e a v e s . curLeaves
+newly added l e a v e s .
10 p u b l i c i n t curMin ;
11 p u b l i c i n t curMax ;
12
13
14 p u b l i c Tree ( ) {
15 Root = new Node ( ) ;
16 Cur = new Node ( ) ;
17 Leaves = new ArrayList () ;
18 evenGen = new ArrayList () ;
19 oddGen = new ArrayList () ;
20
21 }
22
23 // s a e t t e r roden
24 p u b l i c void setRoot ( Node n ) {
25 Root = n ;
26 }
27 // s a e t t e r c u r r e n t node
28 p u b l i c void setCur ( Node n ) {
29 Cur = n ;