Kunstig Intelligens til Brætspillet Taiji - Danmarks Tekniske Universitet

A.2 AITaijiGrowth.java 109
108 f o r ( i n t c =0; c < tModel . noCols ; c++){
109 f o r ( i n t r =0; r < tModel . noRows ; r++){
110 i f ( fb [ c ] [ r ] == f i g s [ 1 ] [ 0 ] [ 0 ] | | fb [ c ] [ r ] ==
f i g s [ 1 ] [ 1 ] [ 0 ] | | fb [ c ] [ r ] == f i g s [ 0 ] [ 0 ] [ 0 ]
| | fb [ c ] [ r ] == f i g s [ 0 ] [ 1 ] [ 0 ] ) {
111 // o e s t
112 i f ( c < tModel . noCols −1){
113 i f ( fb [ c +1][ r ] == 0) {
114 i f ( r < tModel . noRows−1){
115 i f ( fb [ c +1][ r +1] == 0) {
116 i n t [ ] r e ;
117 b [ c +1][ r ] = 1 ;
118 b [ c +1][ r +1] = 0 ;
119 r e = placePieceMax ( b , d , n ,
c +1, r , c +1, r +1,
alpha , beta ) ;
120 alpha = r e [ 1 ] ;
121 beta = r e [ 2 ] ;
122 i f ( r e [ 0 ] == 1) {
123 b [ c +1][ r ] = 2 ;
124 b [ c +1][ r +1] = 2 ;
125 r e t u r n ( r e [ 3 ] ) ;
126 }
127 b [ c +1][ r ] = 0 ;
128 b [ c +1][ r +1] = 1 ;
129 r e = placePieceMax ( b , d , n ,
c +1, r +1, c +1, r ,
alpha , beta ) ;
130 alpha = r e [ 1 ] ;
131 beta = r e [ 2 ] ;
132 i f ( r e [ 0 ] == 1) {
133 b [ c +1][ r ] = 2 ;
134 b [ c +1][ r +1] = 2 ;
135 r e t u r n ( r e [ 3 ] ) ;
136 }
137 b [ c +1][ r ] = 2 ;
138 b [ c +1][ r +1] = 2 ;
139 }
140 }
141 i f ( r > 0) {
142 i f ( fb [ c +1][ r −1] == 0) {
143 i n t [ ] r e ;
144 b [ c +1][ r ] = 1 ;
145 b [ c +1][ r −1] = 0 ;
146 r e = placePieceMax ( b , d , n ,
c +1, r , c +1, r −1,
alpha , beta ) ;
147 alpha = r e [ 1 ] ;
148 beta = r e [ 2 ] ;
149 i f ( r e [ 0 ] == 1) {
150 b [ c +1][ r ] = 2 ;
151 b [ c +1][ r −1] = 2 ;
152 r e t u r n ( r e [ 3 ] ) ;
153 }
154 b [ c +1][ r ] = 0 ;