[1] BoNian Chen, BingJie Shen, Tsansheng Hsu (2010). Chinese Dark Chess. ICGA Journal 33(2), 93–106.
[2] JrChang Chen, GangYu Fan, HungJui Chang, Tsansheng Hsu (2018). Compressing Chinese Dark Chess Endgame Databases by Deep Learning. IEEE Transactions on Games 10(4), 413–422.
[3] JrChang Chen, TingYu Lin, Tsansheng Hsu (2015). Equivalence Classes in Dark Chess Endgames. IEEE Transactions on Computational Intelligence and AI in Games 7(2), 109–122.
[4] J.P. Fishburn (1980). An Optimization of AlphaBeta Search. ACM SIGART Bulletin 72, 29–31.
[5] ChuHsuan Hsueh, IChen Wu, WenJie Tseng, ShiJim Yen, JrChang Chen (2016).
An Analysis for Strength Improvement of an MCTSBased Program Playing Chinese Dark Chess. Theoretical Computer Science 644(C), 63–75.
[6] Judea Pearl (1980). Asymptotic Properties of Minimax Trees and GameSearching Procedures. Artificial Intelligence 14(2), 113–138.
[7] Ken Thompson (1986). Retrograde Analysis of Certain Endgames. ICCA Journal 9(3), 131–139.
[8] Pinghsun Wu, PingYi Liu and Tsansheng Hsu (2004). An ExternalMemory Retrograde Analysis Algorithm. Proceedings of the 4th International Conference on Computers and Games (CG), SpringerVerlag LNCS 3846, 145–160.
[9] ShiJim Yen, ChengWei Chou, JrChang Chen, IChen Wu, KuoYuan Kao (2015).Design and Implementation of Chinese Dark Chess Programs. IEEE Transactions on Computational Intelligence and AI in Games 7(1), 66–74.
[10] 徐 讚 昇 等 人 (2017)。 電 腦 對 局 導 論。 國 立 台 灣 大 學 出 版 中 心,ISBN:9789863502371。
[11] 謝政孝 (2009)。暗棋中棋種間食物鏈關係之探討與實作。國立臺灣師範大學資訊工程研究所,碩士論文。