2018 Ningbo Challenger – Singles
Mikhail Youzhny was the defending champion but retired from professional tennis earlier in the year.
Singles | |
---|---|
2018 Ningbo Challenger | |
Champion | ![]() |
Runner-up | ![]() |
Final score | 7–6(7–4), 4–6, 6–3 |
Thomas Fabbiano won the title after defeating Prajnesh Gunneswaran 7–6(7–4), 4–6, 6–3 in the final.
Seeds
Hubert Hurkacz (Second round) Radu Albot (Semifinals) Thomas Fabbiano (Champion) Ramkumar Ramanathan (First round) Miomir Kecmanović (Semifinals) Enrique López Pérez (First round) Prajnesh Gunneswaran (Final) Tatsuma Ito (Quarterfinals)
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 | ||||||||||||
5 | ![]() | 2 | 2 | ||||||||||
7 | ![]() | 6 | 6 | ||||||||||
7 | ![]() | 64 | 6 | 3 | |||||||||
3 | ![]() | 77 | 4 | 6 | |||||||||
3 | ![]() | 6 | 6 | ||||||||||
2 | ![]() | 1 | 3 | ||||||||||
Top half
First Round | Second Round | Quarterfinals | Semifinals | ||||||||||||||||||||||||
1 | ![]() | 6 | 77 | ||||||||||||||||||||||||
WC | ![]() | 3 | 63 | 1 | ![]() | 64 | 4 | ||||||||||||||||||||
Q | ![]() | 6 | 7 | Q | ![]() | 77 | 6 | ||||||||||||||||||||
WC | ![]() | 4 | 5 | Q | ![]() | 2 | 4 | ||||||||||||||||||||
![]() | 3 | 5 | 5 | ![]() | 6 | 6 | |||||||||||||||||||||
![]() | 6 | 7 | ![]() | 6 | 3 | 4 | |||||||||||||||||||||
WC | ![]() | 1 | 4 | 5 | ![]() | 4 | 6 | 6 | |||||||||||||||||||
5 | ![]() | 6 | 6 | 5 | ![]() | 2 | 2 | ||||||||||||||||||||
4 | ![]() | 6 | 67 | 62 | 7 | ![]() | 6 | 6 | |||||||||||||||||||
![]() | 1 | 79 | 77 | ![]() | 2 | 77 | 6 | ||||||||||||||||||||
![]() | 2 | 5 | ![]() | 6 | 65 | 3 | |||||||||||||||||||||
![]() | 6 | 7 | ![]() | 2 | 1 | ||||||||||||||||||||||
![]() | 4 | 77 | 6 | 7 | ![]() | 6 | 6 | ||||||||||||||||||||
![]() | 6 | 65 | 3 | ![]() | 3 | 6 | 60 | ||||||||||||||||||||
![]() | 67 | 2 | 7 | ![]() | 6 | 2 | 77 | ||||||||||||||||||||
7 | ![]() | 79 | 6 |
Bottom half
First Round | Second Round | Quarterfinals | Semifinals | ||||||||||||||||||||||||
6 | ![]() | 69 | 6 | 67 | |||||||||||||||||||||||
![]() | 711 | 3 | 79 | ![]() | 4 | 67 | |||||||||||||||||||||
![]() | 6 | 2 | 6 | ![]() | 6 | 79 | |||||||||||||||||||||
![]() | 3 | 6 | 4 | ![]() | 6 | 4 | 4 | ||||||||||||||||||||
![]() | 6 | 6 | 3 | ![]() | 1 | 6 | 6 | ||||||||||||||||||||
![]() | 4 | 4 | ![]() | 4 | 4 | ||||||||||||||||||||||
![]() | 6 | 4 | 2 | 3 | ![]() | 6 | 6 | ||||||||||||||||||||
3 | ![]() | 4 | 6 | 6 | 3 | ![]() | 6 | 6 | |||||||||||||||||||
8 | ![]() | 77 | 6 | 2 | ![]() | 1 | 3 | ||||||||||||||||||||
Q | ![]() | 63 | 3 | 8 | ![]() | 6 | 6 | ||||||||||||||||||||
![]() | 1 | 2 | WC | ![]() | 4 | 4 | |||||||||||||||||||||
WC | ![]() | 6 | 6 | 8 | ![]() | 5 | 4 | ||||||||||||||||||||
![]() | 6 | 6 | 2 | ![]() | 7 | 6 | |||||||||||||||||||||
Q | ![]() | 3 | 2 | ![]() | 4 | 63 | |||||||||||||||||||||
Q | ![]() | 4 | 3 | 2 | ![]() | 6 | 77 | ||||||||||||||||||||
2 | ![]() | 6 | 6 |
gollark: What are the axes?
gollark: Well, your graph looks very graphical, I suppose.
gollark: Yes. It might not be possible to do anything but somehow optimize the genetic-algorithm-based approach then.
gollark: That sounds worrying.
gollark: If your problem actually is nice and differentiable - which it sounds like it *might* be, I think you're laying out cables or something? - then it should be a lot faster if you can use that instead of just moving around randomly.
References
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.