Yu-Heng Chen

From Chessprogramming wiki
Jump to: navigation, search

Home * People * Yu-Heng Chen

Yu-Heng Chen,
a Taiwanese computer scientist affiliated with the Department of Computer Science and Information Engineering, National Taiwan Normal University. He works with Shun-Shii Lin et al. on improvements in Monte-Carlo Tree Search (MCTS), adressing the average reward problem in sudden death games (such as connection games) proposing a Minimax MCTS hybrid [1].

Selected Publications



  1. Shun-Shii Lin, Chih-Hung Chen, Yu-Heng Chen, Wei-Lin Wu (2018). Some improvements in Monte Carlo tree search algorithms for sudden death games. CG 2018, ICGA Journal, Vol. 40, No. 4
  2. dblp: Yu-Heng Chen

Up one level