A Proof of the 2004 Albert-Grossman-Nowakowski-Wolfe Conjecture on Alternating Linear Clobber

2025-09-10

AI Summary

This paper resolves the central conjecture posed by Albert et al. (2004) on alternating linear Clobber: except for the unique length-6 configuration “oxoxox”, the first player has a winning strategy on all even-length alternatingly colored paths. The proof employs combinatorial game theory techniques—including position classification, inductive construction, and state decomposition—combined with a rigorous recursive analysis of stone moves under Clobber’s rules. It provides the first complete resolution of this long-standing conjecture, closing a two-decade theoretical gap in combinatorial game theory. The result confirms first-player advantage for nearly all even-length alternating configurations and identifies the structural obstruction inherent in “oxoxox”, characterizing its essential origin in博弈 tree depth and symmetry-breaking properties. Beyond settling the conjecture, the work introduces novel analytical tools and establishes a new theoretical benchmark for solving linear Clobber instances.

Technology Category

• Game Theory and Economic Paradigms: Cooperative Game Theory
• Search and Optimization: Adversarial Search
• Constraint Satisfaction and Optimization: Satisfiability Modulo Theories

Application Category

• Graph Algorithms and Modeling for the Web: Algorithms and analysis for incomplete, noisy, or partially observed Web-related graphs
• Responsible Web: Measurement, analysis, and circumvention of Web censorship
• Web Mining and Content Analysis: Models for Web evolution

Abstract

Clobber is an alternate-turn two-player game introduced in 2001 by Albert, Grossman, Nowakowski and Wolfe. The board is a graph with each node colored black (x), white (o), or empty (-). Player Left has black stones, player Right has white stones. On a turn, a player takes one of their stones that is adjacent to an opponent stone and clobbers the opponent's stone (replaces it with theirs). Whoever cannot move loses. Linear clobber is clobber played on a path, for example, one row of a Go board. In 2004 Albert et al. conjectured that, for every even-length alternating-color linear clobber position except oxoxox, the first player has a winning strategy. We prove their conjecture.

Problem

• Proving the 2004 Albert-Grossman-Nowakowski-Wolfe conjecture on alternating linear clobber
• Determining winning strategies for even-length alternating-color positions
• Resolving first-player advantage in linear path clobber game variations

Innovation

• Proving the 2004 Albert-Grossman-Nowakowski-Wolfe conjecture
• Analyzing alternating linear clobber positions on paths
• Establishing first-player winning strategies for even positions