Difference between revisions of "Tsan-sheng Hsu"
GerdIsenberg (talk | contribs) |
GerdIsenberg (talk | contribs) |
||
Line 48: | Line 48: | ||
* [[Hung-Jui Chang]], [[Jr-Chang Chen]], [[Chih-Wen Hsueh]], [[Tsan-sheng Hsu]] ('''2018'''). ''Analysis and efficient solutions for 2 × 4 Chinese dark chess''. [[ICGA Journal#40_2|ICGA Journal, Vol. 40, No. 2]] » [[Chinese Dark Chess]] | * [[Hung-Jui Chang]], [[Jr-Chang Chen]], [[Chih-Wen Hsueh]], [[Tsan-sheng Hsu]] ('''2018'''). ''Analysis and efficient solutions for 2 × 4 Chinese dark chess''. [[ICGA Journal#40_2|ICGA Journal, Vol. 40, No. 2]] » [[Chinese Dark Chess]] | ||
* [[Chu-Hsuan Hsueh]], [[I-Chen Wu]], [[Tsan-sheng Hsu]], [[Jr-Chang Chen]] ('''2018'''). ''An investigation of strength analysis metrics for game-playing programs: A case study in Chinese dark chess''. [[ICGA Journal#40_2|ICGA Journal, Vol. 40, No. 2]] » [[Chinese Dark Chess]] | * [[Chu-Hsuan Hsueh]], [[I-Chen Wu]], [[Tsan-sheng Hsu]], [[Jr-Chang Chen]] ('''2018'''). ''An investigation of strength analysis metrics for game-playing programs: A case study in Chinese dark chess''. [[ICGA Journal#40_2|ICGA Journal, Vol. 40, No. 2]] » [[Chinese Dark Chess]] | ||
− | * [[Chu-Hsuan Hsueh]], [[I-Chen Wu]], [[Jr-Chang Chen]], [[Tsan-sheng Hsu]] ('''2018'''). ''AlphaZero for a Non-Deterministic Game''. [https://dblp.uni-trier.de/db/conf/taai/taai2018.html TAAI 2018] » [[AlphaZero]] | + | * [[Chu-Hsuan Hsueh]], [[I-Chen Wu]], [[Jr-Chang Chen]], [[Tsan-sheng Hsu]] ('''2018'''). ''AlphaZero for a Non-Deterministic Game''. [https://dblp.uni-trier.de/db/conf/taai/taai2018.html TAAI 2018] » [[AlphaZero]], [[Chinese Dark Chess]] |
=External Links= | =External Links= |
Revision as of 14:20, 7 March 2019
Home * People * Tsan-sheng Hsu
Tsan-sheng Hsu,
a Taiwanese computer scientist and Research Fellow at the Institute of Information Science at the Academia Sinica, Taipei. His research interests concerns graph theory, data privacy, and the design, analysis, implementation and performance evaluation of algorithms [2]. Graph-theoretical techniques were used to efficient construct large endgame databases for Computer Chinese chess [3].
Contents
Programs
Tsan-sheng Hsu is co-author of Chinese Chess programs Contemplation, the Gold medal winner of 9th Computer Olympiad, Ramat-Gan 2004, TMSK, Gold medal winner at the 14th Computer Olympiad, Pamplona 2009 and Silver medal winner at the 15th Computer Olympiad, Kanazawa 2010, and the Chinese Dark Chess programs Flipper (with Bo-Nian Chen), and Sparrow (with Bing-Jie Shen) [4].
Selected Publications
1990 ...
- Tsan-sheng Hsu (1992). On Four-Connecting a Triconnected Graph. (Extended Abstract) FOCS 1992
1995 ...
- Tsan-sheng Hsu, Vijaya Ramachandran, Nathaniel Dean (1995). Implementation of parallel graph algorithms on a massively parallel SIMD computer with virtual processing. IPPS 1995
2000 ...
- Haw-ren Fang, Tsan-sheng Hsu, Shun-Chin Hsu (2000). Construction of Chinese Chess Endgame Databases by Retrograde Analysis. CG 2000
- Tsan-sheng Hsu (2000). On Four-Connecting a Triconnected Graph, Journal of Algorithms, Vol. 35, pp. 202-234.
- Tsan-sheng Hsu (2000). Simpler and Faster Vertex-Connectivity Augmentation Algorithms. ESA 2000 pp. 278-289
- Tsan-sheng Hsu, Ping-yi Liu (2002). Verification of Endgame Databases. ICGA Journal, Vol. 25, No. 3
- Haw-ren Fang, Tsan-sheng Hsu, Shun-Chin Hsu (2002). Indefinite Sequence of Moves in Chinese Chess Endgames. CG 2002
- Haw-ren Fang, Tsan-sheng Hsu, Shun-Chin Hsu (2004). Checking Indefinitely in Chinese-Chess Endgames. ICGA Journal, Vol. 27, No. 1
- Ping-hsun Wu, Ping-Yi Liu, Tsan-sheng Hsu (2004). An External-Memory Retrograde Analysis Algorithm. CG 2004
- Kuang-che Wu, Tsan-sheng Hsu, Shun-Chin Hsu (2004). Contemplation wins Chinese Chess tournament. ICGA Journal, Vol. 27, No. 3 » 9th Computer Olympiad
2005 ...
- Kuang-che Wu, Shun-Chin Hsu, Tsan-sheng Hsu (2005). The Graph-History Interaction Problem in Chinese Chess. Advances in Computer Games 11
- Jaap van den Herik, Shun-Chin Hsu, Tsan-sheng Hsu, Jeroen Donkers (eds.) (2006). 11th International Conference, ACG 2005. Advances in Computer Games 11
- Bo-Nian Chen, Pangfeng Liu, Shun-Chin Hsu, Tsan-sheng Hsu (2006). Abstracting Knowledge from Annotated Chinese-Chess Game Records. CG 2006
- Bo-Nian Chen, Pangfeng Liu, Shun-Chin Hsu, Tsan-sheng Hsu (2008). Knowledge Inferencing on Chinese Chess Endgames. CG 2008
- Bo-Nian Chen, Jian-Yu Chen, Jr-Chang Chen, Tsan-sheng Hsu, Pangfeng Liu, Shun-chin Hsu (2009). An Intelligent Tutoring System of Chinese Chess. IEA/AIE 2009
- Jr-Chang Chen, Bo-Nian Chen, Tsan-sheng Hsu (2009). TMSK wins the Chinese-Chess tournament. ICGA Journal, Vol. 32, No. 2 » 14th Computer Olympiad
2010 ...
- Bo-Nian Chen, Bing-Jie Shen, Tsan-sheng Hsu (2010). Chinese Dark Chess. ICGA Journal, Vol. 33, No. 2
- Bo-Nian Chen, Pangfeng Liu, Shun-Chin Hsu, Tsan-sheng Hsu (2010). Knowledge Abstraction in Chinese Chess Endgame Databases. CG 2010
- Meng-Tsung Tsai, Jen-Hsiang Chuang, Tsan-sheng Hsu et al. (2010). Efficient simulation of the spatial transmission dynamics of influenza. PLoS Currents: Influenza
- Hung-Jui Chang, Meng-Tsung Tsai, Tsan-sheng Hsu (2011). Game Tree Search with Adaptive Resolution. Advances in Computer Games 13, pdf
- Bo-Nian Chen, Pangfeng Liu, Shun-Chin Hsu, Tsan-sheng Hsu (2012). Aggregating consistent endgame knowledge in Chinese Chess. Knowledge Based Systems, Vol. 34
- Hung-Jui Chang, Tsan-sheng Hsu (2013). Quantitative study of 2 by 4 Chinese Dark Chess. CG 2013
- Bo-Nian Chen, Tsan-sheng Hsu (2013). Automatic Generation of Chinese Dark Chess Opening Books. CG 2013
- Bo-Nian Chen, Hung-Jui Chang, Shun-Chin Hsu, Jr-Chang Chen, Tsan-sheng Hsu (2013). Multilevel Inference in Chinese Chess Endgame Knowledge Bases. ICGA Journal, Vol. 36, No. 4
- Bo-Nian Chen, Hung-Jui Chang, Shun-Chin Hsu, Jr-Chang Chen, Tsan-sheng Hsu (2014). Advanced Meta-knowledge for Chinese Chess Endgame Knowledge Bases. ICGA Journal, Vol 37, No. 1
2015 ...
- Jr-Chang Chen, Ting-Yu Lin, Bo-Nian Chen, Tsan-sheng Hsu (2015). Equivalence Classes in Chinese Dark Chess Endgames. IEEE Transactions on Computational Intelligence and AI in Games, Vol. 7, No. 2
- Hung-Jui Chang, Chih-Wen Hsueh, Tsan-sheng Hsu (2015). Convergence and correctness analysis of Monte-Carlo tree search algorithms: A case study of 2 by 4 Chinese dark chess. IEEE CIG 2015
- Hung-Jui Chang, Gang-Yu Fan, Jr-Chang Chen, Chih-Wen Hsueh, Tsan-sheng Hsu (2017). Validating and Fine-Tuning of Game Evaluation Functions Using Endgame Databases. CGW@IJCAI 2017
- Hung-Jui Chang, Jr-Chang Chen, Gang-Yu Fan, Chih-Wen Hsueh, Tsan-sheng Hsu (2018). Using Chinese dark chess endgame databases to validate and fine-tune game evaluation functions. ICGA Journal, Vol. 40, No. 2 » Chinese Dark Chess, Endgame Tablebases
- Hung-Jui Chang, Jr-Chang Chen, Chih-Wen Hsueh, Tsan-sheng Hsu (2018). Analysis and efficient solutions for 2 × 4 Chinese dark chess. ICGA Journal, Vol. 40, No. 2 » Chinese Dark Chess
- Chu-Hsuan Hsueh, I-Chen Wu, Tsan-sheng Hsu, Jr-Chang Chen (2018). An investigation of strength analysis metrics for game-playing programs: A case study in Chinese dark chess. ICGA Journal, Vol. 40, No. 2 » Chinese Dark Chess
- Chu-Hsuan Hsueh, I-Chen Wu, Jr-Chang Chen, Tsan-sheng Hsu (2018). AlphaZero for a Non-Deterministic Game. TAAI 2018 » AlphaZero, Chinese Dark Chess