Difference between revisions of "Shun-Shii Lin"

From Chessprogramming wiki
Jump to: navigation, search
Line 27: Line 27:
 
* [[Yen-Chi Chen]], [[Jia-Fong Yeh]], [[Shun-Shii Lin]] ('''2018'''). ''Design and implementation aspects of a Surakarta program''. [[CG 2018]], [[ICGA Journal#40_4|ICGA Journal, Vol. 40, No. 4]]
 
* [[Yen-Chi Chen]], [[Jia-Fong Yeh]], [[Shun-Shii Lin]] ('''2018'''). ''Design and implementation aspects of a Surakarta program''. [[CG 2018]], [[ICGA Journal#40_4|ICGA Journal, Vol. 40, No. 4]]
 
* [[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]]
 
* [[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]]
 +
* [[Nai-Yuan Chang]], [[Chih-Hung Chen]], [[Shun-Shii Lin]], [[Surag Nair]]  ('''2018'''). ''[https://dl.acm.org/citation.cfm?id=3278325 The Big Win Strategy on Multi-Value Network: An Improvement over AlphaZero Approach for 6x6 Othello]''. [https://dl.acm.org/citation.cfm?id=3278312 MLMI2018]
 
* [[Yen-Chi Chen]], [[Chih-Hung Chen]], [[Shun-Shii Lin]] ('''2018'''). ''[https://dl.acm.org/citation.cfm?id=3293486 Exact-Win Strategy for Overcoming AlphaZero]''. [https://dl.acm.org/citation.cfm?id=3293475 CIIS 2018]  <ref>[https://github.com/LeelaChessZero/lc0/issues/799 "Exact-Win Strategy for Overcoming AlphaZero" · Issue #799 · LeelaChessZero/lc0 · GitHub]</ref>
 
* [[Yen-Chi Chen]], [[Chih-Hung Chen]], [[Shun-Shii Lin]] ('''2018'''). ''[https://dl.acm.org/citation.cfm?id=3293486 Exact-Win Strategy for Overcoming AlphaZero]''. [https://dl.acm.org/citation.cfm?id=3293475 CIIS 2018]  <ref>[https://github.com/LeelaChessZero/lc0/issues/799 "Exact-Win Strategy for Overcoming AlphaZero" · Issue #799 · LeelaChessZero/lc0 · GitHub]</ref>
 
* [[Yen-Chi Chen]], [[Shun-Shii Lin]] ('''2019'''). ''A fast nonogram solver that won the TAAI 2017 and ICGA 2018 tournaments''. [[ICGA Journal#41_1|ICGA Journal, Vol. 41, No. 1]] » [[Bitboards]], [[Nonogram]]
 
* [[Yen-Chi Chen]], [[Shun-Shii Lin]] ('''2019'''). ''A fast nonogram solver that won the TAAI 2017 and ICGA 2018 tournaments''. [[ICGA Journal#41_1|ICGA Journal, Vol. 41, No. 1]] » [[Bitboards]], [[Nonogram]]

Revision as of 20:56, 14 October 2019

Home * People * Shun-Shii Lin

Shun-Shii Lin [1]

Shun-Shii Lin,
a Taiwanese computer scientist, and professor and director of the Graduate Institute of Computer Science and Information Engineering of the National Taiwan Normal University. He received a Ph.D. degree in Information Engineering from the National Taiwan University in 1990, and his research interests include design and analysis of algorithms, parallel processing, real-time system scheduling, and artificial intelligence applied to computer games with focus on Chinese Chess, Go, Mastermind, and Connect6. He is co-author of the Chinese Chess program Elephant and the Connect6 programs Kagami and Ant [2], and co-authored with Shih-Chieh Huang and Rémi Coulom on Monte-Carlo Tree Search applied to computer Go.

Selected Publications

[3]

2004

2005 ...

2010 ...

2015 ...

External Links

References

Up one level