open access

https://hdl.handle.net/2115/64531

A Method of Game Tree Search in Digital Curling Including Uncertainty

日本語

game tree

2016-11-15

情報処理学会

情報処理学会論文誌

57(11)

2354-2364

Computer AI game players have beaten human expert players in two players zero-sum perfect information games such as Go and Japanese Chess and the focus is moving to multiple players, imperfect information games and even with uncertainty such as Mah-jong and Werewolf. Digital curling is one of the games with uncertainty. It has been developed as a testbed of the games with uncertainty to compete computer AI programs and to analyze the curling strategies of human players. This paper proposes an expectimax game tree search method for the digital curling where candidate moves are represented as the combination of the throwing-target position and rotational direction of stones and the discretized board states are nodes of the tree. The method can take into account uncertainty using stochastic transition in the game tree. To evaluate our proposed method, we compare the winning rates of the methods with and without the stochasticity while changing the searching depth. Our results show that our proposed method with the stochasticity is better than without the stochasticity and can only show the effective look ahead. From those results, it is shown that our proposed method could handle uncertainty and perform effective tree search on digital curling.

学術雑誌論文

Version of Record

【ここに掲載した著作物の利用に関する注意】本著作物の著作権は情報処理学会に帰属します。本著作物は著作権者である情報処理学会の許可のもとに掲載するものです。ご利用に当たっては「著作権法」ならびに「情報処理学会倫理綱領」に従うことをお願いいたします。

1882-7764