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

Chang, H.-J.H.-J.ChangHsueh, C.-W.C.-W.HsuehCHIH-WEN HSUEH2020-05-042020-05-042015https://scholars.lib.ntu.edu.tw/handle/123456789/488011[SDGs]SDG16Convergence and correctness analysis of Monte-Carlo tree search algorithms: A case study of 2 by 4 Chinese dark chessconference paper10.1109/CIG.2015.7317963https://www.scopus.com/inward/record.uri?eid=2-s2.0-84964546713&doi=10.1109%2fCIG.2015.7317963&partnerID=40&md5=ab44200f6bae7ddccbb23a88b856171a