Solving Renju

@article{Wgner2001SolvingR,
  title={Solving Renju},
  author={J{\'a}nos W{\'a}gner and I. Vir{\'a}g},
  journal={J. Int. Comput. Games Assoc.},
  year={2001},
  volume={24},
  pages={30-35}
}
  • János Wágner, I. Virág
  • Published 2001
  • Computer Science
  • 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… CONTINUE READING

    Figures, Tables, and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    Games solved: Now and in the future
    231
    NOTE 6 × 6 LOA IS SOLVED
    Paranoid Proof-Number Search
    9
    Solving games: Dependence of applicable solving procedures
    7
    A New Family of k-in-a-Row Games
    63
    Relevance-Zone-Oriented Proof Search for Connect6
    44
    Effective Monte-Carlo Tree Search Strategies for Gomoku AI *
    1
    GDL Meets ATL: A Logic for Game Description and Strategic Reasoning
    3

    References

    Publications referenced by this paper.
    SHOWING 1-7 OF 7 REFERENCES
    Go-Moku and threat-space search
    22
    Proof-Number Search
    180
    Qubic: 4×4×4 Tic-Tac-Toe
    36
    Five-In-A-Row (Renju) for Beginners to Advanced Players
    3
    Searching for solutions in games and artificial intelligence
    378
    Qubic: 4x4x4 Tic-Tac-Toe, Mathematics Magazine 53
    • 1980