Difference between revisions of "Shun-Shii Lin"
GerdIsenberg (talk | contribs) |
GerdIsenberg (talk | contribs) |
||
Line 9: | Line 9: | ||
<ref>[http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/l/Lin:Shun=Shii.html dblp: Shun-Shii Lin]</ref> | <ref>[http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/l/Lin:Shun=Shii.html dblp: Shun-Shii Lin]</ref> | ||
==2004== | ==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] | * [[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 ...== | ==2005 ...== | ||
Line 14: | Line 15: | ||
* [[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''. [[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]] | * [[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] | * [[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 ...== | ==2010 ...== |
Revision as of 10:51, 15 October 2019
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, Outer-Open Gomoku and Connect6. He is co-author of the Chinese Chess programs Elephant and Shark, 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.
Contents
Selected Publications
2004
- Shan-Tai Chen, Shun-Shii Lin, Li-Te Huang, Chun-Jen Wei (2004) Towards the Exact Minimization of BDDs-An Elitism-Based Distributed Evolutionary Algorithm. Journal of Heuristics, Vol. 10, No. 3 [4]
- Shan-Tai Chen, Shun-Shii Lin (2004) Optimal Algorithms for 2 × n AB Games – A Graph-Partition Approach. Journal of Information Science and Engineering, Vol. 20, No. 1, pdf
2005 ...
- Li-Te Huang, Shan-Tai Chen, Shun-Shii Lin (2005). Exact-Bound Analyzes and Optimal Strategies for Mastermind with a Lie. Advances in Computer Games 11
- 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, Vol. 30, No. 3
- Shan-Tai Chen, Shun-Shii Lin, Li-Te Huang, Sheng-Hsuan Hsu (2007). Strategy optimization for deductive games. European Journal of Operational Research, Vol. 183, No. 2
- Shan-Tai Chen, Shun-Shii Lin, Li-Te Huang (2007). A Two-Phase Optimization Algorithm For Mastermind. 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, pdf
2010 ...
- Shih-Chieh Huang, Rémi Coulom, Shun-Shii Lin (2010). Monte-Carlo Simulation Balancing in Practice. CG 2010, pdf
- Shih-Chieh Huang, Rémi Coulom, Shun-Shii Lin (2010). Monte-Carlo Simulation Balancing applied to 9x9 Go. ICGA Journal, Vol. 33, No. 4
- Shih-Chieh Huang, Rémi Coulom, Shun-Shii Lin (2011). Time Management for Monte-Carlo Tree Search Applied to the Game of Go. TAAI 2010, pdf
- Chih-Hung Chen, Shun-Shii Lin, Min-Huei Huang (2012). Volunteer Computing System Applied to Computer Games. TCGA 2012 Workshop, pdf
- Hsuan-Chen Shih, Shun-Shii Lin (2012). 暗棋程式DarkCraft的設計與實作. TCGA 2012 Workshop
- Wen-Jie Tseng, Li-Kai Chuang, I-Chen Wu, Shun-Shii Lin, Shi-Jim Yen (2013). LONGCAT Wins Mahjong Tournament. ICGA Journal, Vol. 36, No. 3 » 17th Computer Olympiad
- 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, Vol. 37, No. 4 » TCGA 2014
2015 ...
- Chih-Hung Chen, Shun-Shii Lin, Yen-Chi Chen (2017). An algorithmic design and implementation of outer-open gomoku. ICCCS 2017
- Yen-Chi Chen, Jia-Fong Yeh, Shun-Shii Lin (2018). Design and implementation aspects of a Surakarta program. CG 2018, 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, Vol. 40, No. 4
- Nai-Yuan Chang, Chih-Hung Chen, Shun-Shii Lin, Surag Nair (2018). The Big Win Strategy on Multi-Value Network: An Improvement over AlphaZero Approach for 6x6 Othello. MLMI2018
- Yen-Chi Chen, Chih-Hung Chen, Shun-Shii Lin (2018). Exact-Win Strategy for Overcoming AlphaZero. CIIS 2018 [5]
- Yen-Chi Chen, Shun-Shii Lin (2019). A fast nonogram solver that won the TAAI 2017 and ICGA 2018 tournaments. ICGA Journal, Vol. 41, No. 1 » Bitboards, Nonogram
External Links
References
- ↑ Shan-Tai Chen, Shun-Shii Lin (2004) Optimal Algorithms for 2 × n AB Games – A Graph-Partition Approach. Journal of Information Science and Engineering, Vol. 20, No. 1, pdf
- ↑ Shun-Shii Lin's ICGA Tournaments
- ↑ dblp: Shun-Shii Lin
- ↑ Binary decision diagram from Wikipedia
- ↑ "Exact-Win Strategy for Overcoming AlphaZero" · Issue #799 · LeelaChessZero/lc0 · GitHub