static double process_route(int nports, int totaldist,
double overestimate_excepting_tail) {
- int i, ap;
+ int i, ap, granui;
int leagues_divisor= totaldist + nports;
ctr_routes_considered++;
return guess[A];
}
- if (guess[A] <= highscores[granus-1][A][0].value &&
- guess[P] <= highscores[granus-1][P][0].value) {
- ctr_routes_quickelim++;
- debugf(" QELIM %f %f\n", guess[A], guess[P]);
- return guess[A];
+ for (granui=0; granui<granus; granui++) {
+ if (guess[A] > highscores[granui][A][0].value ||
+ guess[P] > highscores[granui][P][0].value)
+ goto not_quickelim;
}
+ ctr_routes_quickelim++;
+ debugf(" QELIM %f %f\n", guess[A], guess[P]);
+ return guess[A];
+ not_quickelim:;
}
int finisle= ports[nports-1];
int midarch= route2midarch(ports,nports);
Bucket *buckets[GRANUS];
- int granui;
for (granui=0; granui<granus; granui++) {
Bucket **buckets_fin;
int mid, fin;
}
if (nports>=2) {
- if (guess[A] <= buckets[0]->prs[A].value[A] &&
- guess[P] <= buckets[0]->prs[P].value[P]) {
- ctr_routes_bucketelim++;
- debugf(" ELIM %f %f\n", guess[A], guess[P]);
- return guess[A];
- }
+ for (granui=0; granui<granus; granui++)
+ for (ap=0; ap<AP; ap++)
+ if (guess[ap] > buckets[granui]->prs[ap].value[ap] &&
+ guess[ap] > highscores[granui][ap][0].value)
+ goto not_bucketelim;
+ ctr_routes_bucketelim++;
+ debugf(" ELIM %f %f\n", guess[A], guess[P]);
+ return guess[A];
+ not_bucketelim:
debugf(" COMPUTE %f %f\n", guess[A], guess[P]);
}