1989 Cincinnati Open – Doubles
Rick Leach and Jim Pugh were the defending champions but only Leach competed that year with Laurie Warder.
Doubles | |
---|---|
1989 Cincinnati Open | |
Champions | ![]() ![]() |
Runners-up | ![]() ![]() |
Final score | 6–4, 6–4 |
Leach and Warder lost in the quarterfinals to Pieter Aldrich and Danie Visser.
Ken Flach and Robert Seguso won in the final 6–4, 6–4 against Aldrich and Visser.
Seeds
John Fitzgerald / Anders Järryd (Quarterfinals) Jim Grabb / Patrick McEnroe (Quarterfinals) Ken Flach / Robert Seguso (Champions) Rick Leach / Laurie Warder (Quarterfinals) Mark Kratzmann / Wally Masur (Second Round) Pieter Aldrich / Danie Visser (Final) Jim Courier / Pete Sampras (Semifinals) Carlos di Laura / Javier Frana (Semifinals)
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
Final
Semifinals | Final | ||||||||||||
8 | ![]() ![]() | 6 | 2 | ||||||||||
3 | ![]() ![]() | 7 | 6 | ||||||||||
3 | ![]() ![]() | 6 | 6 | ||||||||||
6 | ![]() ![]() | 4 | 4 | ||||||||||
6 | ![]() ![]() | 7 | 6 | ||||||||||
7 | ![]() ![]() | 6 | 3 | ||||||||||
Top Half
First Round | Second Round | Quarterfinals | Semifinals | ||||||||||||||||||||||||
1 | ![]() ![]() | 6 | 6 | ||||||||||||||||||||||||
![]() ![]() | 3 | 3 | 1 | ![]() ![]() | 6 | 6 | |||||||||||||||||||||
![]() ![]() | 7 | 4 | 4 | ![]() ![]() | 2 | 1 | |||||||||||||||||||||
![]() ![]() | 6 | 6 | 6 | 1 | ![]() ![]() | 6 | 2 | 3 | |||||||||||||||||||
![]() ![]() | 4 | 3 | 8 | ![]() ![]() | 3 | 6 | 6 | ||||||||||||||||||||
![]() ![]() | 6 | 6 | ![]() ![]() | 6 | 3 | 0 | |||||||||||||||||||||
![]() ![]() | 5 | 5 | 8 | ![]() ![]() | 1 | 6 | 6 | ||||||||||||||||||||
8 | ![]() ![]() | 7 | 7 | 8 | ![]() ![]() | 6 | 2 | ||||||||||||||||||||
3 | ![]() ![]() | 5 | 6 | 6 | 3 | ![]() ![]() | 7 | 6 | |||||||||||||||||||
![]() ![]() | 7 | 4 | 4 | 3 | ![]() ![]() | 4 | 7 | 6 | |||||||||||||||||||
![]() ![]() | 3 | 3 | ![]() ![]() | 6 | 6 | 1 | |||||||||||||||||||||
![]() ![]() | 6 | 6 | 3 | ![]() ![]() | 1 | ||||||||||||||||||||||
![]() ![]() | 3 | 2 | ![]() ![]() | 2r | |||||||||||||||||||||||
![]() ![]() | 6 | 6 | ![]() ![]() | 7 | 6 | ||||||||||||||||||||||
![]() ![]() | 2 | 2 | 5 | ![]() ![]() | 6 | 3 | |||||||||||||||||||||
5 | ![]() ![]() | 6 | 6 |
Bottom Half
First Round | Second Round | Quarterfinals | Semifinals | ||||||||||||||||||||||||
6 | ![]() ![]() | 6 | 6 | 6 | |||||||||||||||||||||||
![]() ![]() | 3 | 7 | 3 | 6 | ![]() ![]() | 6 | 7 | ||||||||||||||||||||
![]() ![]() | 7 | 6 | ![]() ![]() | 2 | 6 | ||||||||||||||||||||||
![]() ![]() | 6 | 3 | 6 | ![]() ![]() | 4 | 6 | 7 | ||||||||||||||||||||
![]() ![]() | 7 | 6 | 4 | ![]() ![]() | 6 | 2 | 6 | ||||||||||||||||||||
![]() ![]() | 6 | 0 | ![]() ![]() | 2 | 3 | ||||||||||||||||||||||
![]() ![]() | 1 | 2 | 4 | ![]() ![]() | 6 | 6 | |||||||||||||||||||||
4 | ![]() ![]() | 6 | 6 | 6 | ![]() ![]() | 7 | 6 | ||||||||||||||||||||
7 | ![]() ![]() | 6 | 4 | 6 | 7 | ![]() ![]() | 6 | 3 | |||||||||||||||||||
![]() ![]() | 4 | 6 | 1 | 7 | ![]() ![]() | 6 | 6 | ||||||||||||||||||||
![]() ![]() | 6 | 6 | ![]() ![]() | 3 | 3 | ||||||||||||||||||||||
![]() ![]() | 4 | 3 | 7 | ![]() ![]() | 4 | 6 | 6 | ||||||||||||||||||||
![]() ![]() | 6 | 4 | 6 | 2 | ![]() ![]() | 6 | 4 | 3 | |||||||||||||||||||
![]() ![]() | 2 | 6 | 1 | ![]() ![]() | 1 | 4 | |||||||||||||||||||||
![]() ![]() | 4 | 1 | 2 | ![]() ![]() | 6 | 6 | |||||||||||||||||||||
2 | ![]() ![]() | 6 | 6 |
gollark: Labels would be *really* fast, though. Shame nobody caught onto those before modems.
gollark: Why ever not?
gollark: Labels work out as about 30 bytes per tick with efficient base 187 encoding.
gollark: Or bundled redstone. Adjacent computers can do 2 bytes per tick over bundled.
gollark: <@509348730156220427> I have some useless ideas I can't be bothered to make:- mesh networking- communication between adjacent computers by changing and reading labels very fast
External links
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.