diff options
author | Adam Spragg <adam@spra.gg> | 2022-12-20 14:45:19 +0000 |
---|---|---|
committer | Adam Spragg <adam@spra.gg> | 2022-12-20 14:45:19 +0000 |
commit | 415f51ebad22b1ab890068cad13293489af577a7 (patch) | |
tree | 9d742b8122623e93144d6d55012903ba2cda3f01 /10.txt | |
parent | 5d6aaa249432d6d75637a88ec7a8f8c7d664b091 (diff) |
First attempt at puzzle 19 part 1 (buggy)
It produces *a* result for each blueprint, but not the best result.
I feel like that's a hard problem. The number of decisions about what to
build when over 24 iterations explodes so much that you can't
brute-force the optimal geode count.
Either there's a way of pruning possibilities that I've not thought of,
or there's a pretty good heuristic you can get from the blueprint about
the proportions of how many of each type of material you want to be
producing, that you can pick what to build and get a geode count that
doesn't deviate from optimal in only 24 iterations.
One other possibility is transforming this puzzle into a SAT format and
letting a SAT solver attack it, with its ability to prune decision trees
effectively. But I don't have any actual experience with those, and I'm
not sure I have time to figure that out for AoC.
https://en.wikipedia.org/wiki/SAT_solver
Diffstat (limited to '10.txt')
0 files changed, 0 insertions, 0 deletions