# Solving Go for Rectangular Boards

@article{Werf2009SolvingGF,
title={Solving Go for Rectangular Boards},
author={Erik van der Werf and Mark H. M. Winands},
journal={J. Int. Comput. Games Assoc.},
year={2009},
volume={32},
pages={77-88}
}
• Published 2009
• Computer Science
• J. Int. Comput. Games Assoc.
In 2003, the solution for the 5×5 Go board was published in this journal. The current article presents the game-theoretic values for rectangular boards up to a surface of 30 intersections under Chinese rules. The result was achieved by improving the αβ-based solver MIGOS. Moreover, the article identifies errors in published human solutions by comparing them with our computer solutions.

## Figures and Tables from this paper

• Computer Science
ACG
• 2017
This work explores game-theoretic properties of Positional Linear Go, and incorporates them into a solver based on MTD(f) search, solving states on boards up to 1 $$\times$$ $$9$$.
• Computer Science
Communications in Computer and Information Science
• 2015
Results from a preliminary study on how to best use the data to improve the play of a Chinese Checkers program are reported.
• T. Cazenave
• Computer Science
Communications in Computer and Information Science
• 2021
A general algorithm to order moves so as to speedup exact game solvers using online learning of playout policies and Monte Carlo Tree Search.
• Computer Science
• 2013
This chapter reviews the development of current strong Go programs and the most important extensions to MCTS that are used in this game.
This work uses as an example the predator-prey domain which is a classic multi-agent problem and proposes to solve it on small boards using retrograde analysis.
• Computer Science
IEEE Transactions on Games
• 2020
The board value network is used to calculate the score of the current state and tries to maximize the score and an algorithm is proposed that can adapt to the bonus rule and has the ability to transfer knowledge to the large board.
• M. Winands
• Medicine
Encyclopedia of Computer Graphics and Games
• 2019
The final author version and the galley proof are versions of the publication after peer review that features the final layout of the paper including the volume, issue and page numbers.
Problem jaki stanowi wyszukiwanie strategii optymalnej w grach logicznych jest bardzo zlozony. Mozna go podzielic na nastepujące podproblemy: obliczeniowy, pamieciowy oraz operacji wejścia/wyjścia.
• Computer Science
PRICAI
• 2012
Artificial neural networks are evolved with an EMO algorithm, Pareto Archived Evolution Strategies (PAES) for computer player to learn and play the 7x7 board Go game against GNU Go.

## References

SHOWING 1-10 OF 51 REFERENCES

• Computer Science
J. Int. Comput. Games Assoc.
• 2003
This article presents a search-based approach of solving Go on small boards. A dedicated heuristic evaluation function combined with the static recognition of unconditional territory is used in an
The 6 6 variant of LOA is weakly solved and a Proof-Number search method, PN 2, is used to compute that the game is a win for the first player (Black).
Nine Men's Morris is the first nontrivial game solved in which almost the entire state space has to be considered, and the improved algorithm for computing endgame databases allowed the game to be solved on a personal computer.
• Computer Science
• 2008
This article presents a search-based approach for weakly solving Fanorona, a well-chosen combination of Proof-Number search and endgame databases, and develops techniques for strongly solving the game.
• Computer Science
J. Int. Comput. Games Assoc.
• 2000
Using full-game databases and optimized tree-search algorithms, the game of Kalah is solved for several starting configurations up to 6 holes and 5 counters per hole. The main search algorithm used
• Computer Science
• 2003
The game of awari, an ancient African board game that is played worldwide now, is solved on a large computer cluster using a new parallel search algorithm that optimally uses the resources (processors, memories, disks, and network).
• Physics
ACM '77
• 1977
Moves saved while determining the principal continuation are shown to be good candidates for killer moves when thekiller heuristic supplements the Alpha-Beta search.