Comprehensive Enumeration and Fate Classification of All 512 3 × 3 Initial States in Conway's Game of Life

This record contains the data and materials accompanying the manuscript:“Comprehensive Enumeration and Fate Classification of All 512 3×3 Initial States in Conway’s Game of Life” (v1.0.4). Contents- article_v1.0.4.tex — LaTeX manuscript (version v1.0.4; DOI 10.5281/zenodo.16944178 embedded).- results_512_fixed_boundary_with_period.csv — per-seed outcomes with columns: seed_index, binary_pattern (row-major), class {vanishing|stable|oscillator}, period (0 for vanishing/stable; 2 for oscillators), time_to_convergence (generations).- results_512_seeds.csv — mapping between the 3×3 bit pattern and seed_index (row-major; top-left bit is MSB).- fig_class_counts.png, fig_tconv_hist.png — summary plots; figure1.png — example fates.- README.md, CITATION.cff, checksums.sha256. Methods (summary)We simulate Conway’s Game of Life (B3/S23) on a 9×9 grid with fixed-zero boundaries, up to 128 generations. Each 3×3 seed is centered; outcomes are labelled as vanishing, stable (period 1), or oscillator (least period p≥2). Across all 512 seeds: vanishing = 283 (55.3%), stable = 184 (35.9%), oscillators p=2 = 45 (8.8%); mean time_to_convergence = 6.43, max = 62. How to citeAsgari, S. A. (2025). Comprehensive Enumeration and Fate Classification of All 512 3×3 Initial States in Conway’s Game of Life (v1.0.4) [Dataset]. Zenodo. https://doi.org/10.5281/zenodo.16944178