Name
Abstract | ||
|---|---|---|
WTN-EinStein wurfelt nicht! (abbreviated as EWN) chess game has been attracting much attention owing to its characteristics of randomness and incompleteness. In this study, a modified upper confidence bounds applied to trees (UCT) algorithm is proposed by optimizing selection strategy, simulation of tree nodes and establishing the game tree based on probabilistic rules and natural characteristics of the chess game. Experimental results verify that the program applying the modified UCT algorithm can greatly improve winning rate compared with others with plain UCT or Monte Carlo algorithms. The program won the first prize in 2019 Chinese University Student Computer Games Competition and 13th National Computer Games Tournament. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1109/ICCC49849.2020.9238833 | ICCC |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 7 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiali Li | 1 | 0 | 1.01 |
| Yingying Cai | 2 | 0 | 0.34 |
| Luyao Yu | 3 | 0 | 0.34 |
| Licheng Wu | 4 | 24 | 10.61 |
| Xiaojun Bi | 5 | 0 | 0.34 |
| Yue Zhao | 6 | 186 | 33.54 |
| Bo Liu | 7 | 0 | 0.34 |