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.

diff --git a/math/limlee.c b/math/limlee.c
index 13bbc21..fbed738 100644 (file)
--- 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;
       }