Difference between revisions of "Yu-Heng Chen"

From Chessprogramming wiki
Jump to: navigation, search
(Created page with "'''Home * People * Yu-Heng Chen''' '''Yu-Heng Chen''',<br/> a Taiwanese computer scientist affiliated with the Department of Computer Science and Informatio...")
 
 
Line 2: Line 2:
  
 
'''Yu-Heng Chen''',<br/>
 
'''Yu-Heng Chen''',<br/>
a Taiwanese computer scientist affiliated with the Department of Computer Science and Information Engineering, [https://en.wikipedia.org/wiki/National_Taiwan_Normal_University National Taiwan Normal University].
+
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),
 
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 [https://en.wikipedia.org/wiki/Connection_game connection games]) proposing a [[Minimax]] MCTS hybrid <ref>[[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#40_4|ICGA Journal, Vol. 40, No. 4]]</ref>.  
 
adressing the average reward problem in sudden death games (such as [https://en.wikipedia.org/wiki/Connection_game connection games]) proposing a [[Minimax]] MCTS hybrid <ref>[[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#40_4|ICGA Journal, Vol. 40, No. 4]]</ref>.  

Latest revision as of 15:42, 15 October 2019

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

[2]

References

  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