Convergence and correctness analysis of Monte-Carlo tree search algorithms: A case study of 2 by 4 Chinese dark chess | IEEE Conference Publication | IEEE Xplore