From 2427b43e44e51b1c5f5e00c95cd08ee84b788b05 Mon Sep 17 00:00:00 2001 From: Mark Wooding Date: Sun, 28 May 2017 09:25:19 +0100 Subject: [PATCH] math/limlee.c: Fiddle with the large-prime heuristics. Experimentation shows me that large primes just don't last very long with the old heuristic. Switch to another one that's more tolerant but still weeds out no-hopers. --- math/limlee.c | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/math/limlee.c b/math/limlee.c index 13bbc212..fbed738a 100644 --- a/math/limlee.c +++ b/math/limlee.c @@ -225,7 +225,7 @@ static int next(int rq, pgen_event *ev, limlee_stepctx *l) if (l->qq.p) { dist = l->u.s.disp < 0 ? -l->u.s.disp : l->u.s.disp; - if (dist && dist > l->u.s.steps/dist) { + if (dist && dist > l->u.s.steps/3) { l->pops->pfree(&l->qq, l); l->qq.p = 0; } -- 2.11.0