1986 Milan Indoor – Singles
John McEnroe was the defending champion, but did not participate this year.
Singles | |
---|---|
1986 Milan Indoor | |
Champion | ![]() |
Runner-up | ![]() |
Final score | 6–2, 6–2, 6–4 |
Ivan Lendl won the tournament, beating Joakim Nyström in the final, 6–2, 6–2, 6–4.
Seeds
Ivan Lendl (Champion) Joakim Nyström (Final) Anders Järryd (Semifinals) Miloslav Mečíř (Semifinals) Henrik Sundström (First Round) Tomáš Šmíd (First Round) Jakob Hlasek (Quarterfinals) Jan Gunnarsson (Second 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 | ||||||||||||||
1 | ![]() | 7 | 6 | ||||||||||||
4 | ![]() | 5 | 4 | ||||||||||||
1 | ![]() | 6 | 6 | 6 | |||||||||||
2 | ![]() | 2 | 2 | 4 | |||||||||||
3 | ![]() | 3 | 6 | ||||||||||||
2 | ![]() | 6 | 7 | ||||||||||||
Top Half
First Round | Second Round | Quarterfinals | Semifinals | ||||||||||||||||||||||||
1 | ![]() | 6 | 6 | ||||||||||||||||||||||||
![]() | 3 | 1 | 1 | ![]() | 6 | 7 | |||||||||||||||||||||
Q | ![]() | 6 | 6 | 6 | Q | ![]() | 1 | 5 | |||||||||||||||||||
![]() | 4 | 7 | 2 | 1 | ![]() | 6 | 6 | ||||||||||||||||||||
Q | ![]() | 6 | 4 | 4 | 7 | ![]() | 3 | 4 | |||||||||||||||||||
![]() | 4 | 6 | 6 | ![]() | 6 | 3 | |||||||||||||||||||||
Q | ![]() | 4 | 2 | 7 | ![]() | 7 | 6 | ||||||||||||||||||||
7 | ![]() | 6 | 6 | 1 | ![]() | 7 | 6 | ||||||||||||||||||||
4 | ![]() | 2 | 7 | 6 | 4 | ![]() | 5 | 4 | |||||||||||||||||||
WC | ![]() | 6 | 6 | 3 | 4 | ![]() | 6 | 6 | |||||||||||||||||||
![]() | 6 | 3 | 3 | ![]() | 2 | 4 | |||||||||||||||||||||
![]() | 3 | 6 | 6 | 4 | ![]() | 6 | 6 | ||||||||||||||||||||
![]() | 3 | 6 | 2 | ![]() | 1 | 2 | |||||||||||||||||||||
![]() | 6 | 4 | 6 | ![]() | 6 | 3 | 7 | ||||||||||||||||||||
![]() | 4 | 7 | 6 | ![]() | 2 | 6 | 6 | ||||||||||||||||||||
5 | ![]() | 6 | 6 | 2 |
Bottom Half
First Round | Second Round | Quarterfinals | Semifinals | ||||||||||||||||||||||||
6 | ![]() | 2 | 3 | ||||||||||||||||||||||||
![]() | 6 | 6 | ![]() | 6 | 6 | ||||||||||||||||||||||
Q | ![]() | 4 | 2 | ![]() | 1 | 1 | |||||||||||||||||||||
![]() | 6 | 6 | ![]() | 6 | 5 | ||||||||||||||||||||||
![]() | 1 | 6 | 3 | ![]() | 7 | 7 | |||||||||||||||||||||
![]() | 6 | 7 | ![]() | 2 | 4 | ||||||||||||||||||||||
![]() | 4 | 4 | 3 | ![]() | 6 | 6 | |||||||||||||||||||||
3 | ![]() | 6 | 6 | 3 | ![]() | 3 | 6 | ||||||||||||||||||||
8 | ![]() | 6 | 6 | 2 | ![]() | 6 | 7 | ||||||||||||||||||||
![]() | 4 | 4 | 8 | ![]() | 0 | 2 | |||||||||||||||||||||
![]() | 6 | 6 | 5 | ![]() | 6 | 6 | |||||||||||||||||||||
![]() | 7 | 3 | 7 | ![]() | 1 | 6 | 2 | ||||||||||||||||||||
![]() | 3 | 4 | 2 | ![]() | 6 | 4 | 6 | ||||||||||||||||||||
![]() | 6 | 6 | ![]() | 4 | 2 | ||||||||||||||||||||||
![]() | 3 | 2 | 2 | ![]() | 6 | 6 | |||||||||||||||||||||
2 | ![]() | 6 | 6 |
gollark: Now to watch all the tests fail.
gollark: You know what, I'll ignore this ENTIRELY for now muahahahaha.
gollark: This is in a 130 line function which *kind of* explains what it's doing, but apiaristically.
gollark: It *seemed* like it was just inserting things, but it may also be moving everything after this into the children of the other thingy?
gollark: ```nim var emNode = newDoublyLinkedNode(emToken) for childNode in token.children.nodes: if childNode.value == opener.value.token: emToken.children.head = childNode.next if childNode.next != nil: childNode.next.prev = nil childNode.next = emNode emNode.prev = childNode if childNode.value == closer.value.token: emToken.children.tail = childNode.prev if childNode.prev != nil: childNode.prev.next = nil childNode.prev = emNode emNode.next = childNode```
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.