Tzu-Yang Hsu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Tzu-Yang Hsu has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Chia-Ming Hsu
Academia Sinica, Taiwan
1 shared publication - Jr-Chang Chen
National Taipei University
1 shared publication - Tsan-Sheng Hsu
Institute of Information Science, Academia Sinica, Taipei, Taiwan
1 shared publication
Latest Publications
- Open Access
- 25 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 165-172
Applying Larger N-Tuple Networks to EinStein Wurfelt Nicht!
EinStein würfelt nicht! (abbr. EWN) is a stochastic game with a die rolled in each ply which makes it full of uncertainty. It does not look easy to design a good game engine using traditional alpha-beta-based approaches. In this paper, an EWN game engine is formed by combining n-tuple networks, trained by features extracted from two billion random games, with Monte Carlo Tree Search. Similar work has been proposed previously, but in this work, we compare performances on versions with n = 4, 6 and 9. We discover that 4-tuple networks add no extra strength in comparison with a plain baseline. However, a larger n does bring extra benefit. The jump of performance is noticeable from n = 4 to n = 6 and is very visible from n = 6 to n = 9. The tuple’s size n increases from 4 and 6 to 9. When n = 9, the size of the feature set is much larger than before and cannot be stored plainly in the main memory. One of our main contributions is to come out with a good encoding design taking care of various symmetry or equivalence properties so that it can be used in real-time game playing. Using our scheme, the number of distinct features is reduced to 20,244,124,980, which is 21.21% less than the original 95,440,494,357 features for 9-tuple networks.
- 25 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 165-172
Open AccessApplying Larger N-Tuple Networks to EinStein Wurfelt Nicht!
EinStein würfelt nicht! (abbr. EWN) is a stochastic game with a die rolled in each ply which makes it full of uncertainty. It does not look easy to design a good game engine using traditional alpha-beta-based approaches. In this paper, an EWN game engine is formed by combining n-tuple networks, trained by features extracted from two billion random games, with Monte Carlo Tree Search. Similar work has been proposed previously, but in this work, we compare performances on versions with n = 4, 6 and 9. We discover that 4-tuple networks add no extra strength in comparison with a plain baseline. However, a larger n does bring extra benefit. The jump of performance is noticeable from n = 4 to n = 6 and is very visible from n = 6 to n = 9. The tuple’s size n increases from 4 and 6 to 9. When n = 9, the size of the feature set is much larger than before and cannot be stored plainly in the main memory. One of our main contributions is to come out with a good encoding design taking care of various symmetry or equivalence properties so that it can be used in real-time game playing. Using our scheme, the number of distinct features is reduced to 20,244,124,980, which is 21.21% less than the original 95,440,494,357 features for 9-tuple networks.