Kunstig Intelligens til Brætspillet Taiji - Danmarks Tekniske Universitet

110 Bilag A
155 b [ c +1][ r −1] = 1 ;
156 r e = placePieceMax ( b , d , n ,
c +1, r −1, c +1, r ,
alpha , beta ) ;
157 alpha = r e [ 1 ] ;
158 beta = r e [ 2 ] ;
159 i f ( r e [ 0 ] == 1) {
160 b [ c +1][ r ] = 2 ;
161 b [ c +1][ r −1] = 2 ;
162 r e t u r n ( r e [ 3 ] ) ;
163 }
164 b [ c +1][ r ] = 2 ;
165 b [ c +1][ r −1] = 2 ;
166 }
167 }
168 i f ( c < tModel . noCols −2){
169 i f ( fb [ c +2][ r ] == 0) {
170 i n t [ ] r e ;
171 b [ c +1][ r ] = 1 ;
172 b [ c +2][ r ] = 0 ;
173 r e = placePieceMax ( b , d , n ,
c +1, r , c +2, r , alpha ,
beta ) ;
174 alpha = r e [ 1 ] ;
175 beta = r e [ 2 ] ;
176 i f ( r e [ 0 ] == 1) {
177 b [ c +1][ r ] = 2 ;
178 b [ c +2][ r ] = 2 ;
179 r e t u r n ( r e [ 3 ] ) ;
180 }
181 b [ c +1][ r ] = 0 ;
182 b [ c +2][ r ] = 1 ;
183 r e = placePieceMax ( b , d , n ,
c +2, r , c +1, r , alpha ,
beta ) ;
184 alpha = r e [ 1 ] ;
185 beta = r e [ 2 ] ;
186 i f ( r e [ 0 ] == 1) {
187 b [ c +1][ r ] = 2 ;
188 b [ c +2][ r ] = 2 ;
189 r e t u r n ( r e [ 3 ] ) ;
190 }
191 b [ c +1][ r ] = 2 ;
192 b [ c +2][ r ] = 2 ;
193 }
194 }
195 }
196 }
197 // v e s t
198 i f ( c > 0) {
199 i f ( fb [ c −1][ r ] == 0) {
200 i f ( r < tModel . noRows−1){
201 i f ( fb [ c −1][ r +1] == 0) {
202 i n t [ ] r e ;
203 b [ c −1][ r ] = 1 ;