2017 Nordic Naturals Challenger – Doubles
Nicolaas Scholtz and Tucker Vorster were the defending champions but chose not to defend their title.
Doubles | |
---|---|
2017 Nordic Naturals Challenger | |
Champions | |
Runners-up | |
Final score | 6–3, 2–6, [10–8] |
Jonathan Erlich and Neal Skupski won the title after defeating Alex Bolt and Jordan Thompson 6–3, 2–6, [10–8] in the final.
Seeds
Wesley Koolhof / Artem Sitak (Semifinals) Sam Groth / Scott Lipsky (First round) Jonathan Erlich / Neal Skupski (Champions) Alex Bolt / Jordan Thompson (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 | 77 | |||||||||||||||||||||||||
4 | 65 | 1 | w/o | ||||||||||||||||||||||||
WC | 7 | 7 | WC | ||||||||||||||||||||||||
WC | 5 | 5 | 1 | 3 | 6 | [8] | |||||||||||||||||||||
4 | 4 | 6 | [10] | 4 | 6 | 2 | [10] | ||||||||||||||||||||
6 | 2 | [7] | 4 | 6 | 6 | ||||||||||||||||||||||
6 | 711 | 1 | 3 | ||||||||||||||||||||||||
PR | 3 | 69 | 4 | 3 | 6 | [8] | |||||||||||||||||||||
4 | 4 | 3 | 6 | 2 | [10] | ||||||||||||||||||||||
Q | 6 | 6 | Q | 7 | 4 | [11] | |||||||||||||||||||||
WC | 3 | 2 | 3 | 5 | 6 | [13] | |||||||||||||||||||||
3 | 6 | 6 | 3 | 3 | 6 | [12] | |||||||||||||||||||||
2 | 6 | [3] | LL | 6 | 4 | [10] | |||||||||||||||||||||
6 | 1 | [10] | 77 | 4 | [4] | ||||||||||||||||||||||
LL | 6 | 6 | LL | 63 | 6 | [10] | |||||||||||||||||||||
2 | 4 | 4 |
gollark: You're right, I should just replace my morning snacks with FPGAs.
gollark: Hmm, maybe *I* could purchase an FPGA and see how practical this is.
gollark: Imagine just how many cells you could increment or whatever!
gollark: Maybe stick a small RISC-V core on the FPGA to do general BF preprocessing, then have a main block which runs optimized BF bytecode.
gollark: Yes, just make an optimizing BF interpreter thing on an FPGA.
References
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.