Shortest breeding path to any pal

Pick a target and a set of starting pals, and the planner returns a full breeding chain: every intermediate pair, in order, from what you have to what you want. Route planning uses an exact fixpoint search that minimizes total breeding steps in the dependency tree — it is not a greedy or beam-search approximation, and it has no depth limit.

"Steps" counts breeding operations in the plan's dependency tree: each bred child costs one step plus the steps needed for both of its parents; pals you already have cost zero. If a target can't be reached from your starting set at all, the planner tells you instead of inventing a route. To plan from the pals you actually own, load your save in the save-aware planner.