1993 Grand Prix de Tennis de Lyon – Singles

Pete Sampras was the defending champion and successfully defended his title, beating Cédric Pioline 7–6(7–5), 1–6, 7–5 in the final.

Singles
1993 Grand Prix de Tennis de Lyon
Champion Pete Sampras
Runner-up Cédric Pioline
Final score7–6(7–5), 1–6, 7–5

Seeds

  1. Pete Sampras (Champion)
  2. Boris Becker (First Round)
  3. Michael Stich (First Round)
  4. Andrei Medvedev (First Round)
  5. Cédric Pioline (Final)
  6. Arnaud Boetsch (Quarterfinals)
  7. Andrei Chesnokov (First Round)
  8. Richard Fromberg (Semifinals)

Draw

Key

Finals

Semifinals Final
          
1 Pete Sampras 1 6 77
WC Jakob Hlasek 6 3 63
1 Pete Sampras 77 1 7
WC/5 Cédric Pioline 65 6 5
WC/5 Cédric Pioline 6 62 6
8 Richard Fromberg 3 77 4

Top Half

First Round Second Round Quarterfinals Semifinals
1 P Sampras 7 6  
  T Carbonell 5 3   1 P Sampras 6 6  
  M Naewie 6 7     M Naewie 3 3  
  J Burillo 4 5   1 P Sampras 6 7  
  C Mezzadri 5 6 3   S Simian 4 5  
  S Simian 7 3 6   S Simian 6 4 6
  D Vacek 6 6     D Vacek 3 6 2
7 A Chesnokov 4 3   1 P Sampras 1 6 78
WC/4 A Medvedev 3 4   WC J Hlasek 6 3 66
  K Braasch 6 6     K Braasch 1 78 3
  D Nargiso 3 2   WC J Hlasek 6 66 6
WC J Hlasek 6 6   WC J Hlasek 77 5 7
  A Olhovskiy 77 6   6 A Boetsch 65 7 5
  D Wheaton 64 4     A Olhovskiy 5 3  
  P Kühnen 1 6 1 6 A Boetsch 7 6  
6 A Boetsch 6 3 6

Bottom Half

First Round Second Round Quarterfinals Semifinals
WC/5 C Pioline 710 716  
  Y El Aynaoui 68 614   WC/5 C Pioline 6 6  
  JF Altur 6 4 3   D Rikl 2 1  
  D Rikl 2 6 6 WC/5 C Pioline 7 6  
  M Damm 7 2 6   M Damm 5 2  
Q H Dreekmann 5 6 2   M Damm 6 710  
Q Y Kafelnikov 6 77   Q Y Kafelnikov 4 68  
3 M Stich 3 64   WC/5 C Pioline 6 62 6
8 R Fromberg 64 6 6 8 R Fromberg 3 77 4
  S Pescosolido 77 2 3 8 R Fromberg 6 62 6
  G Raoux 2 4   Q Y Doumbia 4 77 4
Q Y Doumbia 6 6   8 R Fromberg 64 6 77
Q L Barthez 6 77   Q L Barthez 77 4 65
  MA Gorriz 3 65   Q L Barthez 6 6  
  O Delaître 79 64 6   O Delaître 4 4  
2 B Becker 67 77 3
gollark: Does your Pi have the SSH server running?
gollark: It's parser combinator based. I would have to somehow rewrite the grammar to get around it.
gollark: That would preclude adding extra syntax for, well, dice.
gollark: I thought about that, but people would complain and I've already overused RPN calculators a bit as website content.
gollark: ÆÆÆÆÆÆÆÆÆÆÆÆÆÆÆÆÆÆÆÆA left recursionI'm trying to implement an arithmetic parser thing with parser combinators for my dice rolling thing (long story) and it just... recurses infinitely.

References

    This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.