2019 Fairfield Challenger – Doubles
Sanchai Ratiwatana and Christopher Rungkat were the defending champions[1] but chose not to defend their title.
Doubles | |
---|---|
2019 Fairfield Challenger | |
Champions | ![]() ![]() |
Runners-up | ![]() ![]() |
Final score | 6–4, 3–6, [12–10] |
Darian King and Peter Polansky won the title after defeating André Göransson and Sem Verbeek 6–4, 3–6, [12–10] in the final.
Seeds
Robert Galloway / Roberto Maytín (First round) Evan King / Hunter Reese (Quarterfinals) Santiago González / Treat Huey (Quarterfinals, withdrew) André Göransson / Sem Verbeek (Final)
Draw
Key
- Q = Qualifier
- WC = Wild Card
- LL = Lucky Loser
- Alt = Alternate
- SE = Special Exempt
- PR = Protected Ranking
- ITF = ITF entry
- JE = Junior Exempt
- w/o = Walkover
- r = Retired
- d = Defaulted
First Round | Quarterfinals | Semifinals | Final | ||||||||||||||||||||||||
1 | ![]() ![]() | 6 | 4 | [3] | |||||||||||||||||||||||
![]() ![]() | 2 | 6 | [10] | ![]() ![]() | 2 | 6 | [6] | ||||||||||||||||||||
WC | ![]() ![]() | 6 | 64 | [7] | WC | ![]() ![]() | 6 | 4 | [10] | ||||||||||||||||||
WC | ![]() ![]() | 4 | 77 | [10] | WC | ![]() ![]() | 62 | 3 | |||||||||||||||||||
4 | ![]() ![]() | 6 | 6 | 4 | ![]() ![]() | 77 | 6 | ||||||||||||||||||||
![]() ![]() | 0 | 4 | 4 | ![]() ![]() | 3 | 6 | [10] | ||||||||||||||||||||
![]() ![]() | 6 | 4 | [10] | ![]() ![]() | 6 | 4 | [6] | ||||||||||||||||||||
![]() ![]() | 3 | 6 | [12] | 4 | ![]() ![]() | 4 | 6 | [10] | |||||||||||||||||||
![]() ![]() | 77 | 6 | ![]() ![]() | 6 | 3 | [12] | |||||||||||||||||||||
WC | ![]() ![]() | 64 | 4 | ![]() ![]() | w/o | ||||||||||||||||||||||
![]() ![]() | 3 | 4 | 3 | ![]() ![]() | |||||||||||||||||||||||
3 | ![]() ![]() | 6 | 6 | ![]() ![]() | 2 | 6 | [10] | ||||||||||||||||||||
![]() ![]() | 6 | 77 | ![]() ![]() | 6 | 4 | [4] | |||||||||||||||||||||
![]() ![]() | 1 | 64 | ![]() ![]() | 77 | 62 | [10] | |||||||||||||||||||||
![]() ![]() | 68 | 4 | 2 | ![]() ![]() | 64 | 77 | [4] | ||||||||||||||||||||
2 | ![]() ![]() | 710 | 6 |
gollark: Oh, while all is minoteaur, I was thinking it would also be cool™ to have graph visualization.
gollark: Oh no, did my laptop randomly bee itself again?
gollark: Which sound very fancy, although I have no idea how they work.
gollark: On a Discord server for another modern note-taking thing I'm on someone was talking about "n-grams" and "latent dirichlet allocation".
gollark: There are also, if NLP were not so bee, *many* useful approaches I could take to categorize things efficiently.
References
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.