Difference between revisions of "Yen-Chi Chen"

From Chessprogramming wiki
Jump to: navigation, search
Line 5: Line 5:
 
'''Yen-Chi Chen''',<br/>
 
'''Yen-Chi Chen''',<br/>
 
a Taiwanese computer scientist affiliated with the [https://en.wikipedia.org/wiki/National_Taiwan_Normal_University National Taiwan Normal University].
 
a Taiwanese computer scientist affiliated with the [https://en.wikipedia.org/wiki/National_Taiwan_Normal_University National Taiwan Normal University].
His research interests covers [[Learning|machine learning]] and [[Games|computer games]],
+
His research interests include [[Learning|machine learning]] and [[Games|computer games]]. He is author and co-author of [[Chinese Dark Chess]], [[Surakarta]], [[Othello]] and [[Nonogram]] playing and solving programs, participating and winning at [[ICGA]] and [[TAAI]] tournaments.
where he is author and co-author of [[Chinese Dark Chess]], [[Surakarta]], [[Othello]] and [[Nonogram]] playing and solving programs, participating and winning at [[ICGA]] and [[TAAI]] tournaments.
 
  
 
=Exact-Win-MCTS=
 
=Exact-Win-MCTS=

Revision as of 19:41, 14 October 2019

Home * People * Yen-Chi Chen

Yen-Chi Chen [1]

Yen-Chi Chen,
a Taiwanese computer scientist affiliated with the National Taiwan Normal University. His research interests include machine learning and computer games. He is author and co-author of Chinese Dark Chess, Surakarta, Othello and Nonogram playing and solving programs, participating and winning at ICGA and TAAI tournaments.

Exact-Win-MCTS

Along with Shun-Shii Lin and Chih-Hung Chen, Yen-Chi Chen elaborated on an exact-win strategy for overcoming AlphaZero in a Monte-Carlo Tree Search, that makes use of sub-tree's information (WIN, LOSS, DRAW, and UNKNOWN) to prune unneeded moves to increase the opportunities of discovering the critical moves [2].

Selected Publications

[3]

External Links

References

Up one level