Breeding Calculator
Calculate the child from two parents or find all parents for one target.
Open Breeding Calculator →Palworld 1.0 Owned-Pal Breeding Planner
Select the Pals you own, discover every reachable target within one to three generations, and identify the Pals that unlock the most additional breeding routes.
299 Pals · 44,851 Combos · 1–3 Generations · Open Breeding Calculator · Browse All Breeding Combos
Loading Palworld breeding planner…
The planner starts with the Pals in your owned roster and evaluates verified Palworld 1.0 breeding combinations.
| Planner | Path |
|---|---|
| Explore an entire owned roster | One specified target |
| Show every reachable Pal | Show the shortest target route |
| Rank Key Pals that expand coverage | Suggest one missing parent for the target |
Calculate the child from two parents or find all parents for one target.
Open Breeding Calculator →Search all canonical Palworld 1.0 breeding combinations.
Browse Breeding Combos →Find the shortest route between one starting Pal and one target.
Find a Specific Path →Find parents with broad offspring and route coverage.
View Breeding Utility →The planner starts with your owned Pal roster, evaluates verified Palworld 1.0 breeding combinations, and groups reachable targets by the minimum number of breeding steps required.
You need at least two owned Pals to build a plan because each direct breeding result requires two parent Pals.
Step 1 uses two Pals from your owned roster. Step 2 may reuse a Pal produced in Step 1, and Step 3 may reuse Pals produced in earlier steps.
Yes. Multi-step planner results allow newly produced Pals to become parents in later generations.
This planner works in species coverage mode and assumes compatible parent genders are available. Gender-sensitive combinations are preserved in route details when present in the data.
Use Breeding Planner to discover every target available from your roster and identify the Pals that unlock the most additional routes. Use Breeding Path when you already know a specific target and want one shortest route.