Presentation 2014-03-03
Strategy of Hex using betweenness centrality in board network
Kei TAKADA, Masaya HONJO, Hiroyuki IIZUKA, Masahito YAMAMOTO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Hex is a simple board game for two players, but the game strategy becomes very complicated. It is known that all positions of Hex can be represented as two networks. The betweenness centrality in the networks is believed to be effective to evaluate the possible next moves as a Hex strategy, but it is not enough. The conventional studies showed that the shortest path between edges is also important. Therefore, we proposed the evaluation function that can evaluate the betweenness centrality and the shortest path at the same time. Our results of games with Hexy or UCT algorithms showed that the proposed method effectively evaluates the current situations of games with those mixed network indices and becomes stronger.
Keyword(in Japanese) (See Japanese page)
Keyword(in English)
Paper # AI2013-46
Date of Issue

Conference Information
Committee AI
Conference Date 2014/2/24(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Artificial Intelligence and Knowledge-Based Processing (AI)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Strategy of Hex using betweenness centrality in board network
Sub Title (in English)
Keyword(1)
1st Author's Name Kei TAKADA
1st Author's Affiliation Faculty of Engineering, Hokkaido University()
2nd Author's Name Masaya HONJO
2nd Author's Affiliation Graduate School of Information Science and Technology, Hokkaido University
3rd Author's Name Hiroyuki IIZUKA
3rd Author's Affiliation Graduate School of Information Science and Technology, Hokkaido University
4th Author's Name Masahito YAMAMOTO
4th Author's Affiliation Graduate School of Information Science and Technology, Hokkaido University
Date 2014-03-03
Paper # AI2013-46
Volume (vol) vol.113
Number (no) 459
Page pp.pp.-
#Pages 6
Date of Issue