| commit | c39bd336041f2d039450420547ae5ae5c721e43e | |
| author | Eric Blake <eblake@redhat.com> | |
| Sun, 14 Jan 2024 02:19:00 +0000 (13 20:19 -0600) | ||
| committer | Eric Blake <eblake@redhat.com> | |
| Sun, 14 Jan 2024 03:09:33 +0000 (13 21:09 -0600) | ||
| tree | 2ec4693ba73b8593575525849b5fe7d292fb6545 | treesnapshot (tar.gz zip) |
| parent | d60cf6d68fa7d121dce1470c89f65aab3bc8f46b | commitdiff |
day 23 optimize yet again
Prune paths that cannot possibly beat best known score so far. Each
step takes more work, but it cuts the verbose counter from 6M to 1.2M,
and calls to T35 from 1.2M down to 23k. That is, the pruning is
resulting in about 6x fewer paths, cutting the time to 8.6s silent
(~11.5s verbose).
Prune paths that cannot possibly beat best known score so far. Each
step takes more work, but it cuts the verbose counter from 6M to 1.2M,
and calls to T35 from 1.2M down to 23k. That is, the pruning is
resulting in about 6x fewer paths, cutting the time to 8.6s silent
(~11.5s verbose).
| 2023/day23.m4 | diffblobblamehistory |