5 DEBUG_DEFINE_DEBUGF(search);
6 DEBUG_DEFINE_SOME_DEBUGF(filter,fildebugf);
8 typedef struct Neighbour {
9 struct Neighbour *next;
14 static Neighbour **neighbours; /* neighbours[islandid]->islandid etc. */
15 static sqlite3_stmt *ss_neigh;
17 static int ports[MAX_ROUTELEN];
19 static Neighbour *get_neighbours(int isle) {
20 Neighbour **np= &neighbours[isle];
22 if (head) return head;
24 SQL_BIND(ss_neigh, 1, isle);
25 while (SQL_STEP(ss_neigh)) {
26 Neighbour *add= mmalloc(sizeof(*add));
27 add->islandid= sqlite3_column_int(ss_neigh, 0);
28 add->dist= sqlite3_column_int(ss_neigh, 1);
32 SQL_MUST( sqlite3_reset(ss_neigh) );
39 static PotentialResult ***strat_base;
42 static double process_route(int nports, int totaldist,
43 double overestimate_excepting_tail) {
45 int leagues_divisor= totaldist + nports;
47 ctr_routes_considered++;
49 debugf("========== ROUTE");
50 for (i=0; i<nports; i++)
51 debugf(" %d",ports[i]);
54 int finalisle= ports[nports-1];
55 int midisle= ports[nports/2];
57 PotentialResult **strat_fin= ONDEMAND(strat_base[finalisle], islandtablesz);
58 PotentialResult *strat= ONDEMAND(strat_fin[midisle], 1);
62 pair[1]= ports[nports-1];
63 double guess_absolute= overestimate_excepting_tail;
65 for (i=0; i<nports; i++) {
67 IslandPair *ip= ipair_get_maybe(pair[0], pair[1]);
69 if (ip->route_tail_value < 0) {
70 ctr_subroute_tails_valued++;
71 ip->route_tail_value= value_route(2, pair, pair[0]!=pair[1]);
73 guess_absolute += ip->route_tail_value;
75 double guess_perleague= guess_absolute / leagues_divisor;
77 if (guess_absolute <= strat->absolute &&
78 guess_perleague <= strat->perleague) {
79 ctr_routes_eliminated++;
80 debugf(" ELIM %f %f\n", guess_absolute, guess_perleague);
81 return guess_absolute;
83 debugf(" COMPUTE %f %f\n", guess_absolute, guess_perleague);
88 double absolute= value_route(nports, ports, 0);
89 double perleague= absolute / leagues_divisor;
91 if (absolute <= strat->absolute &&
92 perleague <= strat->perleague)
95 debugf(" SOMEHOW BEST\n");
97 fildebugf("final %3d mid %3d ",finalisle,midisle);
99 #define CHK(absperl) \
100 fildebugf(#absperl " %15f", absperl); \
101 if (absperl < strat->absperl) { \
104 strat->absperl= absperl; \
105 memcpy(strat->absperl##_ports, ports, sizeof(*ports) * nports); \
114 for (i=0; i<nports; i++)
115 fildebugf(" %d",ports[i]);
121 static void recurse(int last_isle,
122 int nports, /* excluding last_isle */
123 int totaldist /* including last_isle */,
124 double last_estimate) {
125 ports[nports++]= last_isle;
126 double estimate= process_route(nports, totaldist, last_estimate);
127 if (nports >= MAX_ROUTELEN) return;
130 for (add= get_neighbours(last_isle); add; add=add->next) {
131 int newdist= totaldist + add->dist;
132 if (newdist > max_dist) continue;
134 recurse(add->islandid, nports, newdist, estimate);
138 void search(int start_isle, PotentialResult ****strat_base_io) {
139 strat_base= ONDEMAND(*strat_base_io, islandtablesz);
140 recurse(start_isle,0,0,1e6);
143 void setup_search(void) {
144 neighbours= mcalloc(sizeof(*neighbours) * islandtablesz);
146 SQL_PREPARE(ss_neigh,
147 "SELECT biid, dist FROM routes WHERE aiid=?");