Solving Renju

  title={Solving Renju},
  author={John Wagner and Istv{\'a}n Vir{\'a}g},
  journal={J. Int. Comput. Games Assoc.},
Renju is a very old two-player board game with subtle tactics and strategies. It comes from Japan and is a professional variant of Go-Moku. In many countries, such as China, Estonia, Japan, Latvia, Russia, and Sweden, Renju is played on a high level of performance. Compared to Renju, the game of Go-Moku, mainly played in China and Japan, has rather simple rules. Go-Moku was solved by Allis in 1992. He proved that it is a won game for the player to move first. In this note we claim that Renju is… Expand
Best Play in Fanorona Leads to Draw
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. Expand
Games solved: Now and in the future
It is concluded that decision complexity is more important than state-space complexity as a determining factor in games solved in the domain of two-person zero-sum games with perfect information and there is a trade-off between knowledge-based methods and brute-force methods. Expand
Lines of Action (LOA) is a two-person zero-sum game with perfect information; it is a chess-like game with a connection-based goal. In this note the 6 × 6 variant of LOA is weakly solved. AExpand
Paranoid Proof-Number Search
This work proposes and introduces and examines an algorithm, called Paranoid Proof-Number Search (PPNS), for solving multi-player games under the paranoid condition, and shows that for Rolit PPNS is taking advantage of the non-uniformity of the game tree. Expand
Solving games: Dependence of applicable solving procedures
This concept - based on games currently solved - claims that the applicable solving procedures have a significant influence on the solvability of games, which contrasts with current views that suggest thatsolvability is related to state-space and game-tree complexity. Expand
A New Family of k-in-a-Row Games
A new family of k-in-a-row games, Connect(m,n,k,p,q), is introduced and it is argued that p=2q is a necessary condition for fairness in the sense that one player always has q more stones than the other after making a move. Expand
Relevance-Zone-Oriented Proof Search for Connect6
The proposed RZOP search is a novel, general, and elegant method of constructing and promoting relevance zones, and solved effectively and successfully many new Connect6 game positions, including several Connect6 openings, especially the Mickey Mouse opening. Expand
Effective Monte-Carlo Tree Search Strategies for Gomoku AI *
The Artificial Intelligence for Game AI has been evolved during decades of years. Many solutions for Game AI suggested and it overcomes many complicated games such as Tic-Tac-Toe, Chess, and Go.Expand
GDL Meets ATL: A Logic for Game Description and Strategic Reasoning
This paper presents a logical framework that extends the Game Description Language with coalition operators from Alternating-time Temporal Logic and prioritised strategy connectives, and formally derive Weak Determinacy and Zermelo’s Theorem for two-player games. Expand
Pentago is a First Player Win: Strongly Solving a Game Using Parallel In-Core Retrograde Analysis
A strong solution of the board game pentago is presented, computed using exhaustive parallel retrograde analysis in 4 hours on 98304 threads of NERSC's Cray Edison, and the only example of a nontrivial divergent game solved using retrogradeAnalysis. Expand


Go-Moku and threat-space search
This paper shows that for two common variants of Go-Moku the game-theoretical value has been established and the Go- Moku program Victoria, which uses two new search techniques, threat-space search and proof-number search, achieves good results as a defender against non-optimally playing opponents. Expand
This paper shows that for two common variants of Go‐Moku, the game‐theoretical value has been established and is shown to be equivalent to five in a row on a horizontally placed 15×15 board. Expand
Proof-Number Search
Pn-search has been used to establish the game-theoretical values of Connect-Four, Qubic, and Go-Moku and was able to find a forced win for the player to move first. Expand
Qubic: 4×4×4 Tic-Tac-Toe
Pruning the game tree of three-dimensional tic-tac-toe makes possible a computer-aided proof that the first player can always win.
Searching for solutions in games and artificial intelligence
Five-In-A-Row (Renju) for Beginners to Advanced Players
Qubic: 4x4x4 Tic-Tac-Toe, Mathematics Magazine 53
  • Qubic: 4x4x4 Tic-Tac-Toe, Mathematics Magazine 53
  • 1980