|
Broral (IT)
h, 1979 |
College Star (US)
1972 1.16,3a US$ 37,823 10 3-2-0 | Dartmouth (US)
(71 0,99) 1961 1.14,7a kr 2,039,635 53 21-16-6 | Victory Song (US)
| Volomite (US)
| Peter Volo (US)
| Cita Frisco (US)
| Evensong (US)
| Nelson Dillon (US)
| Taffolet (US)
| Lura Hanover (US)
| Spencer Scott (US)
| Scotland (US)
| May Spencer (US)
| Sorceress (US)
| Volomite (US)
| Mystic (US)
| Star Again (US)
1964 | Speedster (US)
| Rodney (US)
| Spencer Scott (US)
| Earls Princ.Martha (US)
| Mimi Hanover (US)
| Dean Hanover (US)
| Hanover Maid (US)
| Emily Star (US)
| Star's Pride (US)
| Worthy Boy (US)
| Stardrift (US)
| Emily Scott (US)
| Scotland (US)
| May Spencer (US)
| Querida (FR)
1960 | Carioca II (FR)
1946 | Mousko Williams (FR)
| Sam Williams (US)
| Peter Scott (US)
| Blitzie (US)
| Carlotta (FR)
| Enoch (FR)
| Junon (FR)
| Quovaria (FR)
| Javari (FR)
| Quo Vadis (FR)
| Reluisante (FR)
| Champagne III (FR)
| Jongleur (FR)
| Dannemarie (FR)
| Vorona (FR)
1943 | Jakow (FR)
| Telemaque V (FR)
| Eduen (FR)
| Hermione V (FR)
| Braila (FR)
| Kentucky (FR)
| Jeune Etoile (FR)
| Heroine VI (FR)
| Quo Vadis (FR)
| Enoch (FR)
| Junon (FR)
| Argonne II (FR)
| Hoche (FR)
| Nuit de Mai (FR)
|
|
|
|
Pedigree complete in | 5
gen |
Pedigree depth |
17
gen |
Pedigree Completeness Index (5 gen) |
0,98
|
Generation interval (average, 4 gen) | 11,80
|
Ancestor birthyear (average, 4 gen) | 1938,47
|
|
Inbreeding Coefficient (The Blood Bank ) | 0,623 % |
Inbreeding Coefficient (STC) | Not available |
|
Peter the Great | 15 paths, 16 crosses (closest: 6) | Peter Scott | (6+6+7) + 5 | Hambletonian | 1351 paths, 200 crosses (closest: 9) | George Wilkes | 342 paths, 117 crosses (closest: 9) | Electioneer | 41 paths, 42 crosses (closest: 8) | Happy Medium | 17 paths, 18 crosses (closest: 8) | Onward | (9+9+10+11+11+11+11+12+13) + 8 | Red Wilkes | 21 paths, 22 crosses (closest: 8) | Almont | (10+10+11) + (9+9) | Mamie (Mare) | (11+12) + 8 |
|
|
Information on results in big races provided by Kurt Anderssons Travsida.
We do not guarantee that the information is completely accurate and will not be responsible for any errors, omissions or inaccuracies published. |