Revision d010b833
Added by Leszek Koltunski over 1 year ago
| src/main/java/org/distorted/solvers/SolverPyraminx.java | ||
|---|---|---|
| 213 | 213 |
|
| 214 | 214 |
/////////////////////////////////////////////////////////////////////////////////////////////////// |
| 215 | 215 |
|
| 216 |
private int computeEdgePermutation(int[] edge_permutation, int[][] edges)
|
|
| 216 |
private int[] computeEdgeQuats(int[][] edges)
|
|
| 217 | 217 |
{
|
| 218 |
|
|
| 218 |
return null; |
|
| 219 | 219 |
} |
| 220 | 220 |
|
| 221 | 221 |
/////////////////////////////////////////////////////////////////////////////////////////////////// |
| ... | ... | |
| 331 | 331 |
if( vertex_twist[i]<0 ) return ERROR_VERTICES_CANNOT; |
| 332 | 332 |
} |
| 333 | 333 |
|
| 334 |
int[] edge_permutation = new int[6]; |
|
| 335 |
int result5 = computeEdgePermutation(edge_permutation,edges); |
|
| 336 |
if( result5<0 ) return result5; |
|
| 334 |
int[] quats = computeEdgeQuats(edges); |
|
| 335 |
|
|
| 337 | 336 |
|
| 338 | 337 |
return 0; |
| 339 | 338 |
} |
Also available in: Unified diff
Pyraminx solver: progress