chiark
/
gitweb
/
~ianmdlvl
/
matchsticks-search.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
Python code to compute upper bounds on the solution.
[matchsticks-search.git]
/
main.c
diff --git
a/main.c
b/main.c
index d923704f3962c805984567e957e1b02bbcfb2a7d..3ee58c59760729eba27ae8b88123caa59d9062b0 100644
(file)
--- a/
main.c
+++ b/
main.c
@@
-147,8
+147,10
@@
static void set_best(double new_best) {
* subtract a fudge factor from our target.
*/
double near_best = best * 0.98 - 0.02;
* subtract a fudge factor from our target.
*/
double near_best = best * 0.98 - 0.02;
- n_max_frags = ceil(n / near_best) - 1;
- m_max_frags = ceil(m / near_best) - 1;
+ if (near_best > 0) {
+ n_max_frags = ceil(n / near_best) - 1;
+ m_max_frags = ceil(m / near_best) - 1;
+ }
}
/*----- multicore support -----*/
}
/*----- multicore support -----*/
@@
-664,7
+666,7
@@
static void iterate_recurse(int i, AdjWord min) {
if (adjmatrix[i] & jbit)
weight[j]++;
for (int j = 0; j < m; j++)
if (adjmatrix[i] & jbit)
weight[j]++;
for (int j = 0; j < m; j++)
- if (weight[j] >
=
n_max_frags)
+ if (weight[j] > n_max_frags)
goto takeout;
iterate_recurse(i+1, adjmatrix[i]);
goto takeout;
iterate_recurse(i+1, adjmatrix[i]);
@@
-713,7
+715,7
@@
static void report(void) {
continue;
a[x][y] = min + glp_get_col_prim(best_prob, i);
}
continue;
a[x][y] = min + glp_get_col_prim(best_prob, i);
}
- printf("min fragment %g
", min
);
+ printf("min fragment %g
[%s]\n", min, VERSION
);
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
if (a[i][j])
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
if (a[i][j])
@@
-724,18
+726,18
@@
static void report(void) {
printf("\n");
}
} else {
printf("\n");
}
} else {
- printf(" none better than %9.3f
", best
);
+ printf(" none better than %9.3f
[%s]\n", best, VERSION
);
}
}
- printf(" [%s]\n", VERSION);
if (ferror(stdout) || fclose(stdout)) { perror("stdout"); exit(-1); }
}
int main(int argc, char **argv) {
int opt;
if (ferror(stdout) || fclose(stdout)) { perror("stdout"); exit(-1); }
}
int main(int argc, char **argv) {
int opt;
+ double best_to_set = -1.0; /* means 'don't' */
while ((opt = getopt(argc,argv,"j:b:")) >= 0) {
switch (opt) {
case 'j': ncpus = atoi(optarg); break;
while ((opt = getopt(argc,argv,"j:b:")) >= 0) {
switch (opt) {
case 'j': ncpus = atoi(optarg); break;
- case 'b':
set_best(atof(optarg)
); break;
+ case 'b':
best_to_set = atof(optarg
); break;
case '+': assert(!"bad option");
default: abort();
}
case '+': assert(!"bad option");
default: abort();
}
@@
-746,6
+748,7
@@
int main(int argc, char **argv) {
n = atoi(argv[1]);
m = atoi(argv[2]);
assert(n > m);
n = atoi(argv[1]);
m = atoi(argv[2]);
assert(n > m);
+ if (best_to_set > 0) set_best(best_to_set);
prep();
prep();