2015 Aegon Ilkley Trophy – Women's Doubles

Women's Doubles
	2015 Aegon Ilkley Trophy
Champions	Raluca Olaru ; Xu Yifan
Runners-up	An-Sophie Mestach ; Demi Schuurs
Final score	6–3, 6–4

This was the first edition of the tournament on the 2015 ITF Women's Circuit.

Raluca Olaru and Xu Yifan won the inaugural title, defeating An-Sophie Mestach and Demi Schuurs in the final, 6–3, 6–4.

Seeds

Cara Black / Lisa Raymond (Semifinals)
Chuang Chia-jung / Liang Chen (First round)
Kimiko Date-Krumm / Mandy Minella (Semifinals)
Raluca Olaru / Xu Yifan (Champions)

Draw

Key

First round					Quarterfinals					Semifinals					Final

1	C Black L Raymond	6	6
WC	PC Gonçalves B Haddad Maia	3	4		1	C Black L Raymond	6	6
	Y Beygelzimer O Savchuk	3	4			S Aoyama Y Wang	4	3
	S Aoyama Y Wang	6	6							1	C Black L Raymond	6	3	[6]
4	R Olaru Y Xu	6	6							4	R Olaru Y Xu	4	6	[10]
	V Cepede Royg S Vogt	0	3		4	R Olaru Y Xu	6	6
	E Hozumi J Namigata	5	6	[0]		S Foretz S Pe'er	4	4
	S Foretz S Pe'er	7	1	[10]											4	R Olaru Y Xu	6	6
	C-w Chan O Kalashnikova	7⁷	7													A-S Mestach D Schuurs	3	4
WC	A Beck A-L Friedsam	6³	5			C-w Chan O Kalashnikova	7⁷	4	[10]
WC	T Moore N Slater	6	5	[9]	3	K Date-Krumm M Minella	6⁴	6	[12]
3	K Date-Krumm M Minella	4	7	[11]						3	K Date-Krumm M Minella	5	6	[8]
	J Husárová P Kania	2	6	[10]							A-S Mestach D Schuurs	7	2	[10]
	A-S Mestach D Schuurs	6	3	[12]		A-S Mestach D Schuurs	6	6
	N Melichar M Zanevska	6	6			N Melichar M Zanevska	4	2
2	C-j Chuang C Liang	4	4

gollark: I believe this is O(n!), actually.

gollark: The performance is great too. It's not O(n²), it's an even more biggerer and thus superior order.

gollark: Of course.

gollark: I'm not entirely sure how, but it seems to construct a tree/maybe deterministic finite automaton/finite state machine/I don't know theoretical CS which matches anagrams and unmatches unanagrams.

gollark: ```pythonimport collectionsdef do_thing(s): if len(s) == 1: return { s[0]: True } out = {} for i, c in enumerate(s): without = s[:i] + s[i + 1:] things = do_thing(without) out[c] = things return outdef match(r, s): print(r) c = r for i, x in enumerate(s): print(x) try: c = c[x] if c == True: if i + 1 == len(s): return True # full match else: return False # characters remain except KeyError: return False # no match return False # incomplete matchentry = lambda a, b: match(do_thing(a.lower().replace(" ", "")), b.lower().replace(" ", ""))```Here is my entry (pending a port to osmarkslisp™️). This is definitely my entry.

References

Draw

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