| Autor: |
Chia-Ming Hsu, Hung-Cheng Lin, Yueh-Ting Chen, Chih-Wen Hsueh, Tsan-sheng Hsu |
| Jazyk: |
angličtina |
| Rok vydání: |
2024 |
| Předmět: |
|
| Zdroj: |
Scientific Reports, Vol 14, Iss 1, Pp 1-19 (2024) |
| Druh dokumentu: |
article |
| ISSN: |
2045-2322 |
| DOI: |
10.1038/s41598-024-57338-x |
| Popis: |
Abstract A Go endgame database consists of optimal game values and moves for every legal arrangement of no more than S pieces on an N by N board. This paper describes methods for constructing such databases when $$1 < N \le 5$$ 1 < N ≤ 5 and $$S = N^2$$ S = N 2 . When cycles of plies with lengths greater than 4 are encountered, two rules, one allowing cycles and the other disallowing them, are implemented. Observations and knowledge are obtained for these endgames, which may elucidate the fundamental properties of the popular game Go. First, the optimal game values are different when N is even and odd, regardless of whether the repetition of positions is allowed. When N is odd, the first player can occupy the whole board, while this is not the case when N is even. Second, allowing cycles makes the first and second players equal in strength when N is even, whereas the first player always dominates when N is odd. Using the state-of-the-art open-source deep learning Go engine KataGo to correctly solve a given position as an indicator, factors affecting level of difficulty are found, including the distributions of the optimal game values among all legal plies and the cardinality and values of the true optimal plies. A simple formula is designed that works on more than 10% of the positions so that positions with a given level of difficulty can be found with a high probability. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
|
Nepřihlášeným uživatelům se plný text nezobrazuje |
K zobrazení výsledku je třeba se přihlásit.
|
