Solving 7,7,5-game and 8,8,5-game

dc.citation.epage	257	en_US
dc.citation.spage	246	en_US
dc.citation.volume	40	en_US
dc.citation.woscount	0	en_US
dc.contributor.author	Hsu, Wei-Yuan	en_US
dc.contributor.author	Ko, Chu-Ling	en_US
dc.contributor.author	Hsueh, Chu-Hsuan	en_US
dc.contributor.author	Wu, I-Chen	en_US
dc.contributor.department	資訊工程學系	zh_TW
dc.contributor.department	Department of Computer Science	en_US
dc.date.accessioned	2019-04-02T05:58:21Z
dc.date.available	2019-04-02T05:58:21Z
dc.date.issued	2018-01-01	en_US
dc.description.abstract	An mnk-game is a kind of k-in-a-row game played on an m x n chess board, where two players alternatively mark empty squares with their own colors and the first one to get k-consecutive marks wins. This paper solves 7,7,5-game and 8,8,5-game as draws. In the proof, we propose some methods based on pairing strategies and potential weights, and then use a program implementing these methods to solve 7,7,5-game in about one minute and 8,8,5-game in about three days.	en_US
dc.identifier.doi	10.3233/ICG-180061	en_US
dc.identifier.issn	1389-6911	en_US
dc.identifier.journal	ICGA JOURNAL	en_US
dc.identifier.uri	http://dx.doi.org/10.3233/ICG-180061	en_US
dc.identifier.uri	https://ir.lib.nycu.edu.tw/handle/11536/148958
dc.identifier.wosnumber	WOS:000460436000014	en_US
dc.language.iso	en_US	en_US
dc.subject	k-in-a-row games	en_US
dc.subject	mnk-games	en_US
dc.subject	positional games	en_US
dc.subject	pairing strategy	en_US
dc.title	Solving 7,7,5-game and 8,8,5-game	en_US
dc.type	Article	en_US

Files

Now showing 1 - 1 of 1