Construction, observation and knowledge abstraction for go endgames on small boards
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 leng...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Nature Portfolio
2024-03-01
|
| Series: | Scientific Reports |
| Online Access: | https://doi.org/10.1038/s41598-024-57338-x |