Ballard, B.W. (1983). The *-minimax search procedure for trees containing chance nodes. Artificial Intelligence, 21(3), 327–350. doi:10.1016/S0004-3702(83)80015-0.
2.
Chang, H.-J., Chen, J.-C., Fan, G.-Y. & Hsu, T.-s. (2018). Using Chinese dark chess endgame databases to validate and fine-tune game evaluation functions. ICGA Journal, 40(2), 45–60. doi:10.3233/ICG-180048.
3.
Chen, B.-N., Shen, B.-J. & Hsu, T.-s. (2010). Chinese dark chess. ICGA Journal, 33(2), 93–106. doi:10.3233/ICG-2010-33204.
4.
Chen, J.-C., Fan, G.-Y., Chang, H.-J. & Hsu, T.-s. (2018). Compressing Chinese dark chess endgame databases by deep learning. IEEE Transactions on Games, 10(4), 413–422. doi:10.1109/TG.2018.2802484.
5.
Chen, J.-C., Lin, T.-Y. & Hsu, T.-s. (2015). Equivalence classes in dark chess endgames. IEEE Transactions on Games, 7(2), 109–122. doi:10.1080/0740817X.2014.892230.
6.
Hsieh, C.-H. (2010). The study and implementation of food chain relations of the chess spices in Chinese dark chess. Master thesis, Department of Computer Science and Information Engineering, National Taiwan Normal University, Taiwan (in Chinese).
