2017 Aegon Manchester Trophy – Singles
It was the first edition of this women's tennis event.
Singles | |
---|---|
2017 Aegon Manchester Trophy | |
Champion | ![]() |
Runner-up | ![]() |
Final score | 6–4, 6–4 |
Zarina Diyas won the title, defeating Aleksandra Krunić in the final, 6–4, 6–4.
Seeds
Chang Kai-chen (Quarterfinals) Maryna Zanevska (Second round, retired) Alison Van Uytvanck (Second round) Aryna Sabalenka (Semifinals) Anna Blinkova (Quarterfinals) Naomi Broady (Semifinals) Aleksandra Krunić (Final) Jang Su-jeong (First round)
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
Finals
Semifinals | Final | ||||||||||||
6 | ![]() | 3 | 4 | ||||||||||
![]() | 6 | 6 | |||||||||||
![]() | 6 | 6 | |||||||||||
7 | ![]() | 4 | 4 | ||||||||||
4 | ![]() | 0 | 2 | ||||||||||
7 | ![]() | 6 | 6 | ||||||||||
Top half
First Round | Second Round | Quarterfinals | Semifinals | ||||||||||||||||||||||||
1 | ![]() | 6 | 6 | ||||||||||||||||||||||||
![]() | 3 | 3 | 1 | ![]() | 6 | 4 | 6 | ||||||||||||||||||||
WC | ![]() | 4 | 7 | 2 | ![]() | 3 | 6 | 1 | |||||||||||||||||||
![]() | 6 | 5 | 6 | 1 | ![]() | 3 | 4 | ||||||||||||||||||||
Q | ![]() | 6 | 6 | 6 | ![]() | 6 | 6 | ||||||||||||||||||||
Q | ![]() | 3 | 4 | Q | ![]() | 63 | 67 | ||||||||||||||||||||
![]() | 3 | 4 | 6 | ![]() | 77 | 79 | |||||||||||||||||||||
6 | ![]() | 6 | 6 | 6 | ![]() | 3 | 4 | ||||||||||||||||||||
3 | ![]() | 6 | 6 | ![]() | 6 | 6 | |||||||||||||||||||||
![]() | 3 | 3 | 3 | ![]() | 1 | 6 | 4 | ||||||||||||||||||||
![]() | 5 | 6 | 6 | ![]() | 6 | 1 | 6 | ||||||||||||||||||||
![]() | 7 | 3 | 3 | ![]() | 1 | 0 | |||||||||||||||||||||
![]() | 6 | 6 | ![]() | 6 | 6 | ||||||||||||||||||||||
LL | ![]() | 4 | 1 | ![]() | 6 | 6 | |||||||||||||||||||||
![]() | 6 | 4 | 6 | ![]() | 2 | 3 | |||||||||||||||||||||
8 | ![]() | 2 | 6 | 1 |
Bottom half
First Round | Second Round | Quarterfinals | Semifinals | ||||||||||||||||||||||||
5 | ![]() | 6 | 6 | ||||||||||||||||||||||||
![]() | 0 | 2 | 5 | ![]() | 6 | 6 | |||||||||||||||||||||
Q | ![]() | 3 | 77 | 6 | Q | ![]() | 0 | 1 | |||||||||||||||||||
WC | ![]() | 6 | 64 | 2 | 5 | ![]() | 66 | 7 | 3 | ||||||||||||||||||
PR | ![]() | 6 | 2 | 3 | 4 | ![]() | 78 | 5 | 6 | ||||||||||||||||||
![]() | 4 | 6 | 6 | ![]() | 6 | 4 | 3 | ||||||||||||||||||||
![]() | 3 | 63 | 4 | ![]() | 2 | 6 | 6 | ||||||||||||||||||||
4 | ![]() | 6 | 77 | 4 | ![]() | 0 | 2 | ||||||||||||||||||||
7 | ![]() | 5 | 6 | 6 | 7 | ![]() | 6 | 6 | |||||||||||||||||||
![]() | 7 | 3 | 2 | 7 | ![]() | 6 | 6 | ||||||||||||||||||||
WC | ![]() | 6 | 3 | 6 | WC | ![]() | 2 | 4 | |||||||||||||||||||
Q | ![]() | 4 | 6 | 3 | 7 | ![]() | 6 | 6 | |||||||||||||||||||
![]() | 4 | 3 | ![]() | 4 | 1 | ||||||||||||||||||||||
![]() | 6 | 6 | ![]() | 77 | 3 | ||||||||||||||||||||||
![]() | 5 | 2 | 2 | ![]() | 64 | 2r | |||||||||||||||||||||
2 | ![]() | 7 | 6 |
gollark: You can use "search" technology.
gollark: Well, it could be faster, since you could use parallelization and automatically work out optimal routes.
gollark: /ordering
gollark: It would presumably be faster than online delivery.
gollark: Did anyone try making physical store locations where you select items and they're automatically fetched from hidden shelves somewhere?
References
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.