mlsanityData to 7 Oct 2026

A Novel Approach to Solving Goal-Achieving Problems for Board Games

arXiv 2112.02563 ↗First posted 5 Dec 2021cs.AI cs.LGcited by 7

Not on the map. Why?

Abstract (arXiv)

Goal-achieving problems are puzzles that set up a specific situation with a clear objective. An example that is well-studied is the category of life-and-death (L&D) problems for Go, which helps players hone their skill of identifying region safety. Many previous methods like lambda search try null moves first, then derive so-called relevance zones (RZs), outside of which the opponent does not need to search. This paper first proposes a novel RZ-based approach, called the RZ-Based Search (RZS), to solving L&D problems for Go. RZS tries moves before determining whether they are null moves post-hoc. This means we do not need to rely on null move heuristics, resulting in a more elegant algorithm, so that it can also be seamlessly incorporated into AlphaZero's super-human level play in our solver. To repurpose AlphaZero for solving, we also propose a new training method called Faster to Life (FTL), which modifies AlphaZero to entice it to win more quickly. We use RZS and FTL to solve L&D problems on Go, namely solving 68 among 106 problems from a professional L&D book while a previous program solves 11 only. Finally, we discuss that the approach is generic in the sense that RZS is applicable to solving many other goal-achieving problems for board games.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 3 of its 35 references that are in the map. First posted on arXiv 5 Dec 2021.

Builds on

3 of 35 references.

References · 3

  1. 2019ELF OpenGo: An Analysis and Open Reimplementation of AlphaZerocited by 37
  2. 2020Accelerating and Improving AlphaZero Using Population Based Trainingcited by 12
  3. 2017Multi-Labelled Value Networks for Computer Gocited by 5

Built on by

Cited by year

Citing papers per year: 2022: 3; 2023: 1; 2024: 1; 2025: 2.

7 papers.