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
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
A.4 AI<strong>Taiji</strong>Minimax.java 145<br />
139 tTree . oddGen . add ( p . addChild ( tNode .<br />
createChildNode ( c , r , c +1, r , p ) ) ) ;<br />
140 count++;<br />
141 }<br />
142 }<br />
143<br />
144 b [ c ] [ r ] = 0 ;<br />
145 b [ c +1][ r ] = 1 ;<br />
146 i = c h e c k B o a r d I n d i v i d u a l i t y ( b , d ) ;<br />
147 i f ( i >= 0) {<br />
148 i f ( d % 2 == 1)<br />
149 tTree . evenGen . get ( i ) . par . add ( p ) ;<br />
150 i f ( d % 2 == 0)<br />
151 tTree . oddGen . get ( i ) . par . add ( p ) ;<br />
152 }<br />
153 i f ( i == −1){<br />
154 i f ( d % 2 == 1) {<br />
155 tTree . evenGen . add ( p . addChild ( tNode .<br />
createChildNode ( c +1, r , c , r , p ) ) ) ;<br />
156 count++;}<br />
157 i f ( d % 2 == 0) {<br />
158 tTree . oddGen . add ( p . addChild ( tNode .<br />
createChildNode ( c +1, r , c , r , p ) ) ) ;<br />
159 count++;<br />
160 }<br />
161 }<br />
162 b [ c ] [ r ] = 2 ;<br />
163 b [ c +1][ r ] = 2 ;<br />
164 // tTree . addLeave ( p . addChild ( tNode .<br />
createChildNode ( c , r , c +1, r , p ) ) ) ;<br />
165 // tTree . addLeave ( p . addChild ( tNode .<br />
createChildNode ( c +1, r , c , r , p ) ) ) ;<br />
166 }<br />
167 }<br />
168 }<br />
169 }<br />
170<br />
171 // Checker om e t b r a e t a l l e r e d e e k s i s t e r e i en node ,<br />
172 // r e t u r n e r e r i f o r p l a c e r i n g paa node med samme b r a e t e l l e r −1,<br />
h v i s der i k k e f i n d e s en<br />
173 p r i v a t e i n t c h e c k B o a r d I n d i v i d u a l i t y ( i n t [ ] [ ] b , i n t d ) {<br />
174 i f ( d % 2 == 1) {<br />
175 // System . out . p r i n t l n (” minimax checkBI s i z e even ”+tTree .<br />
evenGen . s i z e ( ) ) ;<br />
176 f o r ( i n t i = 0 ; i