Difference between revisions of "Tsan-sheng Hsu"

From Chessprogramming wiki
Jump to: navigation, search
Line 43: Line 43:
 
==2015 ...==
 
==2015 ...==
 
* [[Jr-Chang Chen]], [[Ting-Yu Lin]], [[Bo-Nian Chen]], [[Tsan-sheng Hsu]] ('''2015'''). ''[http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=4804728 Equivalence Classes in Chinese Dark Chess Endgames]''. [[IEEE#TOCIAIGAMES|IEEE Transactions on Computational Intelligence and AI in Games]], Vol. 7, No. 2
 
* [[Jr-Chang Chen]], [[Ting-Yu Lin]], [[Bo-Nian Chen]], [[Tsan-sheng Hsu]] ('''2015'''). ''[http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=4804728 Equivalence Classes in Chinese Dark Chess Endgames]''. [[IEEE#TOCIAIGAMES|IEEE Transactions on Computational Intelligence and AI in Games]], Vol. 7, No. 2
 +
* [[Hung-Jui Chang]], [[Gang-Yu Fan]], [[Jr-Chang Chen]], [[Chih-Wen Hsueh]], [[Tsan-sheng Hsu]] ('''2017'''). ''[https://link.springer.com/chapter/10.1007/978-3-319-75931-9_10 Validating and Fine-Tuning of Game Evaluation Functions Using Endgame Databases]''. [[Conferences#IJCAI2017|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#40_2|ICGA Journal, Vol. 40, No. 2]] » [[Chinese Dark Chess]], [[Endgame Tablebases]]
 
* [[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#40_2|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#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]]

Revision as of 16:29, 22 October 2018

Home * People * Tsan-sheng Hsu

Tsan-sheng Hsu [1]

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].

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

[5] [6] [7]

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 ...

2005 ...

2010 ...

2015 ...

External Links

References

Up one level