2016 Brest Challenger – Singles

Singles
	2016 Brest Challenger
Champion	Norbert Gombos
Runner-up	Yannik Reuter
Final score	7–5, 6–2

Ivan Dodig was the defending champion but chose not to defend his title.

Norbert Gombos won the title after defeating Yannik Reuter 7–5, 6–2 in the final.

Seeds

Jérémy Chardy (Semifinals)
Lukáš Lacko (Quarterfinals)
Marco Chiudinelli (Second round)
Alessandro Giannessi (First round)
Steven Diez (Quarterfinals)
Luca Vanni (First round)
Quentin Halys (Withdrew)
Marko Tepavac (Quarterfinals)

Draw

Key

Finals

Semifinals					Final


1	Jérémy Chardy	4	7	2

	Yannik Reuter	6	5	6
						Yannik Reuter	5	2

					LL	Norbert Gombos	7	6
	Julien Benneteau	6³	6	4

LL	Norbert Gombos	7⁷	3	6

Top half

First Round					Second Round					Quarterfinals				Semifinals

1	J Chardy	6	6
SE	S Tsitsipas	2	3		1	J Chardy	6	6
SE	M Janvier	4	6⁴			A Nedovyesov	4	4
	A Nedovyesov	6	7⁷							1	J Chardy	6	6
Q	G Jacq	6	2							5	S Diez	1	2
	M Donati	3	1^r		Q	G Jacq	6⁴	1
	Marc Sieber	4	1		5	S Diez	7⁷	6
5	S Diez	6	6											1	J Chardy	4	7	2
4	A Giannessi	1	6¹												Y Reuter	6	5	6
Q	M Neuchrist	6	7⁷		Q	M Neuchrist	3	6	5
	A Sidorenko	2	4			A Šetkić	6	4	7
	A Šetkić	6	6								A Šetkić	2	4
Q	Y Marti	5	6	3							Y Reuter	6	6
	Yannik Reuter	7	3	6		Y Reuter	6	6
	P Krstin	7⁷	7			P Krstin	4	4
6	L Vanni	6⁵	5

Bottom half

First Round					Second Round					Quarterfinals					Semifinals

8	M Tepavac	6	6
	A Golubev	3	4		8	M Tepavac	6⁷	6	6
	Y Mertens	2	0^r		Q	R Jouan	7⁹	2	3
Q	R Jouan	6	1							8	M Tepavac	2	1
	J Benneteau	6	5	6							J Benneteau	6	6
	N Milojević	4	7	3		J Benneteau	6	6
WC	E Furness	4	5		3	M Chiudinelli	2	0
3	M Chiudinelli	6	7													J Benneteau	6³	6	4
LL	N Gombos	6	6												LL	N Gombos	7⁷	3	6
LL	S Gillé	4	3		LL	N Gombos	6	4	7
	A Menéndez-Maceiras	6³	4			J Jahn	3	6	5
	Jeremy Jahn	7⁷	6							LL	N Gombos	3	6	7⁷
WC	C Moutet	6	4	7						2	L Lacko	6	4	6⁵
WC	L Lokoli	1	6	5	WC	C Moutet	2	4
	G Barrère	1	1		2	L Lacko	6	6
2	L Lacko	6	6

gollark: Once no more pairs can be substituted, it uses a large table of the frequencies of each symbol (`qfreqs`) to efficiently encode a sequence of those symbols as a large number, "efficiently".

gollark: Pairs of symbols (initially just the bytes given to the thing) in the input are repeatedly substituted for symbols from the dictionary (the `real_bped` blob).

gollark: Well, I guess bees good.

gollark: I don't count bzip because no.

gollark: And maybe whatever #12 does.

References

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