2016 Kobe Challenger – Singles
John Millman was the defending champion but chose not to defend his title.
Singles | |
---|---|
2016 Kobe Challenger | |
Champion | ![]() |
Runner-up | ![]() |
Final score | 6–4, 7–6(7–2) |
Chung Hyeon won the title after defeating James Duckworth 6–4, 7–6(7–2) in the final.
Seeds
Yūichi Sugita (First round) Yoshihito Nishioka (Quarterfinals) Taro Daniel (First round) Go Soeda (Semifinals) Chung Hyeon (Champion) Lee Duck-hee (Semifinals) James Duckworth (Final) Tatsuma Ito (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 | ![]() | 62 | 4 | ||||||||||
7 | ![]() | 77 | 6 | ||||||||||
7 | ![]() | 4 | 62 | ||||||||||
5 | ![]() | 6 | 77 | ||||||||||
4 | ![]() | 3 | 77 | 3 | |||||||||
5 | ![]() | 6 | 64 | 6 | |||||||||
Top half
First Round | Second Round | Quarterfinals | Semifinals | ||||||||||||||||||||||||
1 | ![]() | 3 | 2 | ||||||||||||||||||||||||
![]() | 6 | 6 | ![]() | 6 | 6 | ||||||||||||||||||||||
![]() | 6 | 6 | ![]() | 2 | 3 | ||||||||||||||||||||||
Q | ![]() | 4 | 0 | ![]() | 1 | 0r | |||||||||||||||||||||
![]() | 4 | 4 | 6 | ![]() | 6 | 2 | |||||||||||||||||||||
WC | ![]() | 6 | 6 | WC | ![]() | 1 | 2 | ||||||||||||||||||||
Q | ![]() | 1 | 6 | 3 | 6 | ![]() | 6 | 6 | |||||||||||||||||||
6 | ![]() | 6 | 3 | 6 | 6 | ![]() | 62 | 4 | |||||||||||||||||||
3 | ![]() | 1 | 1 | 7 | ![]() | 77 | 6 | ||||||||||||||||||||
![]() | 6 | 6 | ![]() | 3 | 3 | ||||||||||||||||||||||
![]() | 3 | 60 | ![]() | 6 | 6 | ||||||||||||||||||||||
![]() | 6 | 77 | ![]() | 5 | 62 | ||||||||||||||||||||||
![]() | 5 | 4 | 7 | ![]() | 7 | 77 | |||||||||||||||||||||
![]() | 7 | 6 | ![]() | 3 | 2 | ||||||||||||||||||||||
Q | ![]() | 0 | 77 | 4 | 7 | ![]() | 6 | 6 | |||||||||||||||||||
7 | ![]() | 6 | 64 | 6 |
Bottom half
First Round | Second Round | Quarterfinals | Semifinals | ||||||||||||||||||||||||
8 | ![]() | 63 | 6 | 4 | |||||||||||||||||||||||
![]() | 77 | 4 | 6 | ![]() | 4 | 66 | |||||||||||||||||||||
![]() | 7 | 6 | ![]() | 6 | 78 | ||||||||||||||||||||||
Q | ![]() | 5 | 4 | ![]() | 2 | 6 | 1 | ||||||||||||||||||||
WC | ![]() | 3 | 1 | 4 | ![]() | 6 | 1 | 6 | |||||||||||||||||||
WC | ![]() | 6 | 6 | WC | ![]() | 0 | 67 | ||||||||||||||||||||
![]() | 1 | 0 | 4 | ![]() | 6 | 79 | |||||||||||||||||||||
4 | ![]() | 6 | 6 | 4 | ![]() | 3 | 77 | 3 | |||||||||||||||||||
5 | ![]() | 6 | 6 | 5 | ![]() | 6 | 64 | 6 | |||||||||||||||||||
![]() | 1 | 3 | 5 | ![]() | 1 | 7 | 6 | ||||||||||||||||||||
![]() | 2 | 4 | ![]() | 6 | 5 | 3 | |||||||||||||||||||||
![]() | 6 | 6 | 5 | ![]() | 7 | 6 | |||||||||||||||||||||
![]() | 6 | 64 | 6 | 2 | ![]() | 5 | 4 | ||||||||||||||||||||
WC | ![]() | 2 | 77 | 3 | ![]() | 1 | 4 | ||||||||||||||||||||
![]() | 4 | 2 | 2 | ![]() | 6 | 6 | |||||||||||||||||||||
2 | ![]() | 6 | 6 |
gollark: Also, `mmap` any file you need to read onto random pointers, since I heard `mmap` is fast.
gollark: You should also use osmarksmalloc™, as it's HIGHLY fast since it doesn't have to actually bother with maintaining records to deallocate anything.
gollark: `dale` isn't a daemon or anything, and won't run for very long, so it's more performant to just leak memory and leave it to the OS.
gollark: I think I made it segfault a few times.
gollark: It actually exposed tons of bugs in a CC emulator.
References
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.