A solver for Minecraft Dungeons' Ancient Hunts, works out which item combinations to offer at the obelisk to roll a target rune set, and which Ancients those runes can summon.
In Minecraft Dungeons, Ancient Hunts let you offer four items (one melee, one armour, one artifact, one ranged) to an obelisk. Each item contributes specific runes (Charge, Range, Insight, Allegiance, Quarry, Unite, Strength, Trail, Persistence, the C/R/I/A/Q/U/S/T/P system), and the total rune count across all four items determines which Ancient bosses you can fight.
Working out by hand which combination gives the runes you want, while accounting for which items you actually own duplicates of, and which uniques you're willing to sacrifice, is a pain. This calculator brute-forces every valid combination and ranks them by how many Ancients the resulting runes can summon.
The page ships with hard-coded rune contributions for ~60 melee weapons, ~25 ranged weapons, ~25 armour pieces, and ~10 artifacts, every offerable item in the base game (and most DLC).
On load it: groups items by rune signature, generates the cartesian product across the four slots (one of each), counts how many of the configured Ancient bosses each combination unlocks, sorts by that count descending, and lists the winners.
Two filter toggles in the source control which items are included:
noUniques: when true, excludes uniques (you usually only have one of each)duplicatesOnly: when true, only considers items where you'd reasonably have multiple to sparedlc: placeholder switch for DLC-only items
Edit the boolean flags at the top of calculator.html to change what gets considered.
F12 (or right-click → Inspect → Console tab) to see the ranked list of combinations.
Other things worth knowing:
- Item rune data is a manual transcription from the game and may be slightly out of date for newer DLC items.
- A few items are listed in source comments as "to-do", Truthseeker, Fangs of Frost, Maulers, Firebolt Thrower, Ancient Bow are all noted as not yet entered.
- The brute-force can hit ~30,000 combinations on the loosest filter settings, the page mentions this as the algorithmic ceiling before stack-overflowing the recursive quicksort.