-/**/
+/*
+ * Route searcher - recursive iteration over all routes
+ */
+/*
+ * This is part of the YARRG website, a tool for assisting
+ * players of Yohoho Puzzle Pirates.
+ *
+ * Copyright (C) 2009 Ian Jackson <ijackson@chiark.greenend.org.uk>
+ *
+ * This program is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU Affero General Public License as
+ * published by the Free Software Foundation, either version 3 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU Affero General Public License for more details.
+ *
+ * You should have received a copy of the GNU Affero General Public License
+ * along with this program. If not, see <http://www.gnu.org/licenses/>.
+ *
+ * Yohoho and Puzzle Pirates are probably trademarks of Three Rings and
+ * are used without permission. This program is not endorsed or
+ * sponsored by Three Rings.
+ */
#include "rscommon.h"
}
-static PotentialResult ***strat_base;
+static Bucket ***buckets_base[GRANUS];
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[A][0].value &&
- guess[P] <= highscores[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 finarch= isle2arch(finisle);
+ int finisle= ports[nports-1];
+ int finarch= isle2arch(finisle);
+
+ int midisle= ports[nports/2];
int midarch= route2midarch(ports,nports);
- PotentialResult **strat_fin= ONDEMAND(strat_base[finarch], narches);
- PotentialResult *strat= ONDEMAND(strat_fin[midarch], 1);
+ Bucket *buckets[GRANUS];
+ for (granui=0; granui<granus; granui++) {
+ Bucket **buckets_fin;
+ int mid, fin;
+ switch (granui) {
+ case 0: fin=finarch; mid=midarch; break;
+ case 1: fin=finisle; mid=midarch; break;
+ case 2: fin=finisle; mid=midisle; break;
+ default: abort();
+ }
+ buckets_fin= ONDEMAND(buckets_base[granui][fin], granusz_mid[granui]);
+ buckets[granui]= ONDEMAND(buckets_fin[mid], 1);
+ }
if (nports>=2) {
- if (guess[A] <= strat->value[A] &&
- guess[P] <= strat->value[P]) {
- ctr_routes_stratelim++;
- 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]);
}
return value[0];
}
- if (value[A] <= strat->value[A] &&
- value[P] <= strat->value[P])
- return value[A];
-
- debugf(" SOMEHOW BEST\n");
-
- fildebugf("final %d:%3d mid %d ",finarch,finisle,midarch);
-
- for (ap=0; ap<AP; ap++) {
- fildebugf("ap=%d %15f", ap, value[ap]);
- if (value[ap] < strat->value[ap]) {
- debugf(" ");
- } else {
- int pos;
- ctr_newbests_strat[ap]++;
- strat->value[ap]= value[ap];
- memcpy(strat->ports[ap], ports, sizeof(*ports) * nports);
- if (nports < MAX_ROUTELEN-1) strat->ports[ap][nports]= -1;
- fildebugf("** ");
- for (pos=0; pos < nhighscores[ap]; pos++)
- if (highscores[ap][pos].pr == strat) goto found;
- /* not found */
- pos= -1;
- found:
- for (;;) {
- pos++;
- if (pos >= nhighscores[ap]-1) break; /* new top */
- if (highscores[ap][pos].value >= value[ap]) break; /* found spot */
- if (pos>0)
- highscores[ap][pos-1]= highscores[ap][pos];
- }
- pos--;
- if (pos>0) {
- highscores[ap][pos].value= value[ap];
- highscores[ap][pos].pr= strat;
- }
- fildebugf("@%2d", pos);
- }
- }
+ for (granui=granus-1; granui>=0; granui--) {
+ Bucket *bucket= buckets[granui];
+
+ if (value[A] <= bucket->prs[A].value[A] &&
+ value[P] <= bucket->prs[P].value[P])
+ continue;
+
+ debugf(" SOMEHOW %d BEST\n",granui);
+
+ fildebugf("granu %d f%d:%3d mid%d:%3d ",granui,
+ finarch,finisle,midarch,midisle);
+
+ for (ap=0; ap<AP; ap++) {
+ HighScoreEntry *scores= highscores[granui][ap];
+ int nscores= nhighscores[granui][ap];
+
+ fildebugf("ap=%d %15f", ap, value[ap]);
+ if (value[ap] < bucket->prs[ap].value[ap]) {
+ debugf(" ");
+ } else {
+ int pos;
+ ctr_newbests_granu[granui*AP+ap]++;
+ bucket->prs[ap].length= totaldist;
+ memcpy(bucket->prs[ap].value, value, sizeof(value));
+ memcpy(bucket->prs[ap].ports, ports, sizeof(*ports) * nports);
+ if (nports < MAX_ROUTELEN-1) bucket->prs[ap].ports[nports]= -1;
+ fildebugf("** ");
+ for (pos=0; pos < nscores; pos++)
+ if (scores[pos].bucket == bucket) goto found;
+ /* not found */
+ pos= -1;
+ found:
+ for (;;) {
+ pos++;
+ if (pos >= nscores) break; /* new top */
+ if (scores[pos].value >= value[ap]) break; /* found spot */
+ if (pos>0)
+ scores[pos-1]= scores[pos];
+ }
+ pos--;
+ if (pos>0) {
+ scores[pos].value= value[ap];
+ scores[pos].bucket= bucket;
+ if (granui < granus-1 &&
+ highscores[granui][A][0].bucket &&
+ highscores[granui][P][0].bucket) {
+ /* both absolute and perleague are full at this granularity,
+ * so we don't care about anything more granular */
+ fildebugf("\n STOP-GRANU ");
+ granus= granui+1;
+ }
+ }
+ fildebugf("@%2d/%2d ", pos, nscores);
+ } /* new best */
+ } /* ap */
+ } /* granui */
fildebugf(" route");
}
static void recurse(int last_isle,
- int nports, /* excluding last_isle */
+ int nports /* excluding last_isle */,
int totaldist /* including last_isle */,
double last_estimate) {
ports[nports++]= last_isle;
}
void search(int start_isle, int final_isle_spec,
- PotentialResult ****strat_base_io) {
- strat_base= ONDEMAND(*strat_base_io, narches);
+ Bucket ****buckets_base_io[GRANUS]) {
+ int granui;
+ for (granui=0; granui<GRANUS; granui++)
+ buckets_base[granui]=
+ ONDEMAND(*buckets_base_io[granui], granusz_fin[granui]);
+
final_isle= final_isle_spec <= 0 ? 0 : final_isle_spec;
recurse(start_isle,0,0,1e6);
}
-int nhighscores[AP];
-HighScoreEntry *highscores[AP];
+int nhighscores[GRANUS][AP];
+HighScoreEntry *highscores[GRANUS][AP];
+int granus=GRANUS, granusz_fin[GRANUS], granusz_mid[GRANUS];
int narches;
char **archnames;
islandid2arch[isle]= arch;
}
sqlite3_finalize(archs);
+
+ granusz_fin[0]= granusz_mid[0]= narches;
+ granusz_fin[1]= islandtablesz; granusz_mid[1]= narches;
+ granusz_fin[2]= granusz_mid[2]= islandtablesz;
}
~yarrgweb / ypp-sc-tools.db-test.git / blobdiff