Both-parents-available rule
Path Finder chains breeding steps starting from Pals you mark as owned.
A step is valid only when both parents are already in your owned set or were produced by an earlier step. Children become available only after their producing step.
Parallel breeding depth
The search minimizes parallel breeding depth: the number of generations required when independent pairs can be bred concurrently.
Step depth is max(depth(parent1), depth(parent2)) + 1. Owned starters have depth 0.
Step counts and limitations
The reported step count equals path.length for the plan Path Finder returns. That count is not asserted to be globally minimal across every conceivable sequential plan.
Path Finder excludes gender-specific rows from search. Passive skills, IVs, incubation time, and cake costs are not calculated.
Citation block
- Definition
- Path Finder builds a sequential breeding plan under strict both-parents-available semantics, optimizing for minimum parallel breeding depth in the pinned graph.
- Example
- With a small owned set, Path Finder may return a multi-step plan where each step uses only Pals already owned or bred in earlier steps.
- Exceptions
- Gender-specific rows are excluded from path search; unreachable source distances (≥ 10,000) are treated as blocked.
- Limitations
- steps equals path.length and is not asserted globally minimal; passives, IVs, incubation time, and cake costs are excluded.
- Source/version
- PalCalc v27, upstream commit f6cc27362b090dd33c3c3ee612075b9b514ace4d.
- Updated
- 2026-08-01