25,161
edits
Changes
no edit summary
'''Shun-Shii Lin''',<br/>
a Taiwanese computer scientist, and professor and director of the Graduate Institute of Computer Science and Information Engineering of the [https://en.wikipedia.org/wiki/National_Taiwan_Normal_University [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|algorithms]], [https://en.wikipedia.org/wiki/Parallel_processing parallel processing], [https://en.wikipedia.org/wiki/Real-time_computing real-time system] [https://en.wikipedia.org/wiki/Scheduling_%28computing%29 scheduling], and [[Artificial Intelligence|artificial intelligence]] applied to computer games with focus on [[Chinese Chess]], [[Go]], [https://en.wikipedia.org/wiki/Mastermind_%28board_game%29 Mastermind], [[Outer-Open Gomoku]] and [[Connect6]]. He is co-author of the Chinese Chess program programs [https://www.game-ai-forum.org/icga-tournaments/program.php?id=113 [Elephant (Xiangqi)|Elephant] ] and [[Shark (Xiangqi)|Shark]], and the Connect6 programs [https://www.game-ai-forum.org/icga-tournaments/program.php?id=591 Kagami] and [https://www.game-ai-forum.org/icga-tournaments/program.php?id=645 Ant] <ref>[https://www.game-ai-forum.org/icga-tournaments/person.php?id=101 Shun-Shii Lin's ICGA Tournaments]</ref>, and co-authored with [[Shih-Chieh Huang]] and [[Rémi Coulom]] on [[Monte-Carlo Tree Search]] applied to computer Go.
=Selected Publications=
<ref>[http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/l/Lin:Shun=Shii.html dblp: Shun-Shii Lin]</ref>
==2004==
* [[Shan-Tai Chen]], [[Shun-Shii Lin]], [[Li-Te Huang]], [https://dblp.uni-trier.de/pers/hd/w/Wei:Chun=Jen Chun-Jen Wei] ('''2004''') ''[https://link.springer.com/article/10.1023/B:HEUR.0000026899.63797.f9 Towards the Exact Minimization of BDDs-An Elitism-Based Distributed Evolutionary Algorithm]''. [https://dblp.uni-trier.de/db/journals/heuristics/heuristics10.html Journal of Heuristics, Vol. 10], No. 3 <ref>[https://en.wikipedia.org/wiki/Binary_decision_diagram Binary decision diagram from Wikipedia]</ref>
* [[Shan-Tai Chen]], [[Shun-Shii Lin]] ('''2004''') ''Optimal Algorithms for 2 × n AB Games – A Graph-Partition Approach''. [http://www.informatik.uni-trier.de/~ley/db/journals/jise/jise20.html#ChenL04 Journal of Information Science and Engineering, Vol. 20], No. 1, [http://www.rosenbaum-games.de/3m/p1/Mastermind/2003shantai02.pdf pdf]
==2005 ...==
* [[Li-Te Huang]], [[Shan-Tai Chen]], [[Shih-Chieh Huang]], [[Shun-Shii Lin]] ('''2007'''). ''An Efficient Approach to Solve Mastermind Optimally''. [[CGW 2007]]
* [[Li-Te Huang]], [[Shan-Tai Chen]], [[Shih-Chieh Huang]], [[Shun-Shii Lin]] ('''2007'''). ''An Efficient Approach to Solve Mastermind Optimally''. [[ICGA Journal#30_3|ICGA Journal, Vol. 30, No. 3]]
* [[Shan-Tai Chen]], [[Shun-Shii Lin]], [[Li-Te Huang]], [[Sheng-Hsuan Hsu]] ('''2007'''). ''[https://www.sciencedirect.com/science/article/abs/pii/S0377221706008927 Strategy optimization for deductive games]''. [https://en.wikipedia.org/wiki/European_Journal_of_Operational_Research European Journal of Operational Research], Vol. 183, No. 2
* [[Shan-Tai Chen]], [[Shun-Shii Lin]], [[Li-Te Huang]] ('''2007'''). ''[https://dl.acm.org/citation.cfm?id=1349531 A Two-Phase Optimization Algorithm For Mastermind]''. [https://en.wikipedia.org/wiki/The_Computer_Journal The Computer Journal], Vol. 50, No. 4
* [[Li-Te Huang]], [[Shun-Shii Lin]] ('''2009'''). ''Optimal Analyses for 3×n AB Games in the Worst Case''. [[Advances in Computer Games 12]], [http://www.rosenbaum-games.de/3m/p1/Mastermind/2009LiTe01.pdf pdf]
==2010 ...==
* [[Shun-Shii Lin]], [[Chih-Hung Chen]], [[Shun-Chin Hsu]], [[I-Chen Wu]], [[Shi-Jim Yen]], [[Jr-Chang Chen]] ('''2014'''). ''TCGA 2014 Computer Game Tournament''. [[ICGA Journal#37_4|ICGA Journal, Vol. 37, No. 4]] » [[TCGA 2014]]
==2015 ...==
* [[Chih-Hung Chen]], [[Shun-Shii Lin]], [[Yen-Chi Chen]] ('''2017'''). ''[https://ieeexplore.ieee.org/document/8075180 An algorithmic design and implementation of outer-open gomoku]''. [https://ieeexplore.ieee.org/xpl/conhome/8055814/proceeding ICCCS 2017]
* [[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]]
* [[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]], [[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]]
==2020 ...==
* [[Lu-Nung Chen]], [[Shun-Shii Lin]], [[Chih-Hung Chen]] ('''2020'''). ''Jump wins Chinese Checkers tournament''. [[ICGA Journal#42_1|ICGA Journal, Vol. 42, No. 1]] » [[22nd Computer Olympiad]]
* [[Yen-Chi Chen]], [[Shun-Shii Lin]] ('''2020'''). ''Requiem wins Nonogram tournament''. [[ICGA Journal#42_1|ICGA Journal, Vol. 42, No. 1]]
=External Links=
