完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Wu, IC | en_US |
dc.contributor.author | Huang, DY | en_US |
dc.contributor.author | Chang, HC | en_US |
dc.date.accessioned | 2014-12-08T15:18:02Z | - |
dc.date.available | 2014-12-08T15:18:02Z | - |
dc.date.issued | 2005-12-01 | en_US |
dc.identifier.issn | 1389-6911 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/13043 | - |
dc.description.abstract | This note introduces the game Connect6, a member of the family of the k-in-a-row games, and investigates some related issues. We analyze the fairness of Connect6 and show that Connect6 is potentially fair. Then we describe other characteristics of Connect6, e.g., the high game-tree and state-space complexities. Thereafter we present some threat-based winning strategies for Connect6 players or programs. Finally, the note describes the current developments of Connect6 and lists five new challenges. | en_US |
dc.language.iso | en_US | en_US |
dc.title | Connect6 | en_US |
dc.type | Article | en_US |
dc.identifier.journal | ICGA JOURNAL | en_US |
dc.citation.volume | 28 | en_US |
dc.citation.issue | 4 | en_US |
dc.citation.spage | 235 | en_US |
dc.citation.epage | 242 | en_US |
dc.contributor.department | 資訊工程學系 | zh_TW |
dc.contributor.department | Department of Computer Science | en_US |
dc.identifier.wosnumber | WOS:000236274900005 | - |
dc.citation.woscount | 5 | - |
顯示於類別: | 期刊論文 |