About

An unofficial, single-purpose tool for one of Minecraft's most annoying arithmetic problems: the cheapest order to combine enchanted books.

What it computes

Given a target item and a set of books, it enumerates every binary combine tree and every left/right orientation within its book budget, prices each operation with the Minecraft Wiki's anvil formula, and returns the minimum-total sequence. The output includes the per-step cost and flags any operation above the 39-level Survival cap.

Sources

Enchantment cost multipliers, the prior-work penalty formula (2ⁿ − 1), the max-plus-one rule for the result's counter, and the 39-level cap are taken from the Minecraft Wiki's Anvil mechanics page (checked Nov 17, 2026, Java Edition). The ordering algorithm is written for this site.

What it doesn't do

Not affiliated with Mojang Studios or Microsoft. Minecraft is a trademark of Mojang Synergies AB.