What the solver can prove, and what it cannot.

Fast search is for quick exploration. It can find promising lines quickly, but it is not a final guarantee for every rules edge case.

Exact proof is stricter and intended to confirm whether a line is guaranteed under the supported model. If unsupported mechanics are involved, exact proof can still miss reality.

The engine supports the card scripts and battle rules that have been implemented in this codebase. Coverage grows as more puzzles and cards are added.

Validation can catch missing card codes, invalid instance IDs, impossible DON!! totals, and broken solution references, but it cannot automatically judge every puzzle-design problem.

A puzzle state is a modeled scenario. Known deck, life, hand, and trash contents are only as accurate as the author enters them.

When hidden information matters, authors should document the assumption in notes. A line is only guaranteed relative to the hidden information and defensive options modeled by the puzzle.

When checking a line, try the puzzle manually, compare the move log against the board, and treat exact proof as confirmation only within the supported model.

Watch for trivial puzzles, too many winning lines, unsupported effects, unclear hidden information, and solutions that depend on an unstated opponent mistake.