2016 Chengdu Challenger – Doubles

Doubles
	2016 Chengdu Challenger
Champion	Gong Maoxin; Zhang Ze
Runner-up	Gao Xin; Li Zhe
Final score	6–3, 4–6, [13–11]

Gong Maoxin and Zhang Ze won the title after defeating Gao Xin and Li Zhe 6–3, 4–6, [13–11] in the final.

This was the first edition of the tournament.

Seeds

Nicolás Barrientos / Peng Hsien-yin (First round)
Hsieh Cheng-peng / Yang Tsung-hua (First round)
Jeevan Nedunchezhiyan / Yi Chu-huan (Semifinals)
Gong Maoxin / Zhang Ze (Champions)

Draw

Key

First Round					Quarterfinals				Semifinals				Final

1	N Barrientos H-y Peng	5	6	[8]
	X Gao Z Li	7	3	[10]		X Gao Z Li	7⁷	6
WC	Cai Zhao Zhong Suhao	4	4			S-w Kwon K Uchida	6⁵	4
	S-w Kwon K Uchida	6	6							X Gao Z Li	6	6
3	J Nedunchezhiyan C-h Yi	7	7⁷						3	J Nedunchezhiyan C-h Yi	4	3
	T Chen E López-Pérez	5	6⁵		3	J Nedunchezhiyan C-h Yi	6	6
	A Bega A Pavić	6	6			A Bega A Pavić	1	0
WC	Y He F Sun	2	4											X Gao Z Li	3	6	[11]
WC	B Ouyang Z Qiu	3	2										4	M Gong Z Zhang	6	4	[13]
	R Ramírez Hidalgo P Riba	6	6			R Ramírez Hidalgo P Riba	4	4
	E Karlovskiy D Petrović	3	6	[7]	4	M Gong Z Zhang	6	6
4	M Gong Z Zhang	6	4	[10]					4	M Gong Z Zhang	6	6
	JP Fruttero J Jung	6	6⁶	[3]						J Wang D Wu	3	4
	T Matsui G Soeda	4	7⁸	[10]		T Matsui G Soeda	2	3
	J Wang D Wu	6	6			J Wang D Wu	6	6
2	C-p Hsieh T-h Yang	2	1

gollark: Also, in that version there, patterns got fed in as a table with numeric indices from 1-9 representing each slot of the crafting table plus an optional qty key for how much the recipe produces.

gollark: Ridiculous. We *need* to be able to break maths in a snippet of code.

gollark: Here is a copy of the code I don't understand from the old version:```lualocal function descend(intermediateFn, terminalFn, i) local pattern = patterns[i] if pattern then intermediateFn(pattern) local pqty = pattern.qty -- Qty keys must be removed from the pattern for collation -- Otherwise, it shows up as a number stuck in the items needed table, which is bad. pattern.qty = nil local needs = util.collate(pattern) pattern.qty = pqty local has = {} for slot, item in pairs(pattern) do if util.satisfied(needs, has) then break end if patterns[item] then descend(intermediateFn, terminalFn, item) has[item] = (has[item] or 0) + (patterns[item].count or 1) end end else terminalFn(i) endendlocal function cost(i) local items = {} descend(function() end, function(i) table.insert(items, i) end, i) return util.collate(items)endlocal function tasks(i) local t = {} descend(function(pat) table.insert(t, pat) end, function() end, i) return tend```

gollark: Also, implementing whatever is done internally for finding free space to transfer to is hard!

gollark: I'm unlikely to have stupidly large autocrafting trees.

References

Main Draw

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