summary |
shortlog |
log |
commit | commitdiff |
tree
raw |
patch |
inline | side by side (from parent 1:
3fba56c)
printf("before reduction, moves are ");
x = nodes[circuit[0]] / DP1 % w;
y = nodes[circuit[0]] / DP1 / w;
printf("before reduction, moves are ");
x = nodes[circuit[0]] / DP1 % w;
y = nodes[circuit[0]] / DP1 / w;
p = min(i, j);
q = max(i, j);
p = min(i, j);
q = max(i, j);
printf("optimising section from %d - %d\n", p, q);
#endif
printf("optimising section from %d - %d\n", p, q);
#endif
if (dir > 0)
i = q; /* resume loop from the right place */
if (dir > 0)
i = q; /* resume loop from the right place */
printf("new section runs from %d - %d\n", p, q);
#endif
printf("new section runs from %d - %d\n", p, q);
#endif
printf("during reduction, circuit is");
for (k = 0; k < circuitlen; k++) {
int nc = nodes[circuit[k]];
printf("during reduction, circuit is");
for (k = 0; k < circuitlen; k++) {
int nc = nodes[circuit[k]];
printf("after reduction, moves are ");
x = nodes[circuit[0]] / DP1 % w;
y = nodes[circuit[0]] / DP1 / w;
printf("after reduction, moves are ");
x = nodes[circuit[0]] / DP1 % w;
y = nodes[circuit[0]] / DP1 / w;