Exhaustive fresh-book anvil optimizer

Minecraft Anvil Order Calculator for Fresh Enchantment Books

Choose one fresh supported item and one to ten unique fresh single-enchantment books. Exhaustive subset DP finds the globally cheapest survival-feasible merge order inside that exact Java 26.2 model and explains every level and prior-work transition.

Fresh inputs only

One fresh item plus unique fresh single-enchantment books; no existing gear, prior-work values, duplicate books, or multi-enchantment books.

  • Repair, rename, item-item merge, probability, commands, arbitrary existing books, and XP-point optimization are excluded.
  • The frozen rules and labels target Minecraft Java 26.2, not Bedrock or server plugins.

Global only inside this model

Subset DP explores every valid merge partition and deterministic tie-break, not a greedy insertion order.

  • Survival-feasible plans first
  • Level cost is not the nonlinear number of XP points spent.

Choose one fresh supported item and 1–10 unique fresh single-enchantment books. MapMC exhaustively searches the frozen survival model for a deterministic globally minimum anvil order.

Loading the verified Java 26.2 anvil model…

Fresh target item

Start with an unenchanted, undamaged item that has no prior anvil work.

Technical item ID—

Existing enchantments, damage, repair cost, renaming, and prior work are not accepted.

Fresh single-enchantment books

Each selected book contains exactly one unique enchantment at one supported level.

c

  1. Book 1

    Supported levels: 1–—

Duplicate enchantments and multi-enchantment books are outside this model.

Use between 1 and 10 books.

A deliberately closed anvil model

The optimizer can make a strong global claim because every accepted starting state and transition is fixed.

Fresh inputs only
One fresh item plus unique fresh single-enchantment books; no existing gear, prior-work values, duplicate books, or multi-enchantment books.
Global only inside this model
Subset DP explores every valid merge partition and deterministic tie-break, not a greedy insertion order.
Excluded anvil tasks
Repair, rename, item-item merge, probability, commands, arbitrary existing books, and XP-point optimization are excluded.

The frozen rules and labels target Minecraft Java 26.2, not Bedrock or server plugins.

The item, books, search, plan, copy, and TXT stay in this browser session.

Minecraft Anvil Order Calculator FAQ

Which item and books does this optimizer accept?
Use one fresh unenchanted and undamaged supported item with no prior work, plus 1–10 unique fresh books that each contain exactly one supported enchantment.
Why can changing the merge order change the level cost?
Book-book merges and book-to-item merges create different prior-work values and step costs. The optimizer evaluates valid subset combinations instead of inserting books in a fixed or greedy order.
Is the result globally optimal and survival-feasible?
Yes, but only inside the frozen fresh-input model. It minimizes total level cost with deterministic secondary tie-breaks, and every successful survival step costs fewer than 40 levels.
Does it handle existing gear, enchanting-table odds, or XP points?
No. Existing enchantments, damage, prior work, duplicate or multi-enchantment books, repair, rename, item-item merge, table probability, commands, and nonlinear XP-point optimization are excluded.

Related MapMC tasks

Browse Minecraft building and pixel art tools

Browse Minecraft building and pixel art tools

Calculate item stacks separately

Calculate item stacks separately

Open the Java command generator

Open the Java command generator