| 217 | |
| 218 | //pruning table |
| 219 | public static void createPrun(byte[] prunTable, int depth, short[][] moveTable, int times) { |
| 220 | int total = prunTable.length; |
| 221 | int moves = moveTable[0].length; |
| 222 | int c = 1; |
| 223 | for (int d = 0; d < depth; d++) { |
| 224 | for (int i = 0; i < total; i++) |
| 225 | if (prunTable[i] == d) |
| 226 | for (int j = 0; j < moves; j++) { |
| 227 | int next = i; |
| 228 | for (int k = 0; k < times; k++) { |
| 229 | next = moveTable[next][j]; |
| 230 | if (prunTable[next] < 0) { |
| 231 | prunTable[next] = (byte) (d + 1); |
| 232 | c++; |
| 233 | } |
| 234 | } |
| 235 | } |
| 236 | Log.w("dct", d + 1 + "\t" + c); |
| 237 | } |
| 238 | } |
| 239 | |
| 240 | public static void createPrun(byte[] prunTable, int depth, short[][] moveTable1, short[][] moveTable2, int times) { |
| 241 | //int total = prunTable.length; |