| 167 | int[] prm = new int[8]; |
| 168 | |
| 169 | void getSquare(Square sq) { |
| 170 | //TODO |
| 171 | // byte[] prm = new byte[8]; |
| 172 | for (int a = 0; a < 8; a++) { |
| 173 | prm[a] = (byte) (pieceAt(a * 3 + 1) >> 1); |
| 174 | } |
| 175 | //convert to number |
| 176 | sq.cornperm = Utils.get8Perm(prm, 8); |
| 177 | |
| 178 | int a, b; |
| 179 | //Strip top layer edges |
| 180 | sq.topEdgeFirst = pieceAt(0) == pieceAt(1); |
| 181 | a = sq.topEdgeFirst ? 2 : 0; |
| 182 | for (b = 0; b < 4; a += 3, b++) prm[b] = (byte) (pieceAt(a) >> 1); |
| 183 | |
| 184 | sq.botEdgeFirst = pieceAt(12) == pieceAt(13); |
| 185 | a = sq.botEdgeFirst ? 14 : 12; |
| 186 | |
| 187 | // if (pieceAt(12)==pieceAt(13)) { a=14; sq.botEdgeFirst=false; } |
| 188 | // else { a=12; sq.botEdgeFirst=true; } |
| 189 | for ( ; b < 8; a += 3, b++) prm[b] = (byte) (pieceAt(a) >> 1); |
| 190 | sq.edgeperm = Utils.get8Perm(prm, 8); |
| 191 | |
| 192 | sq.ml = ml; |
| 193 | } |
| 194 | |
| 195 | boolean isSolved() { |
| 196 | return ul == 0x011233 && ur == 0x455677 && dl == 0x998bba && dr == 0xddcffe && ml == 0; |