Multi-Agent GenOS Evolves Algorithms: Brute Force Beats SAT Solver
MonokoEloba · reddit · 2026-08-20
The author built a multi-agent framework, GenOS, where LLM sub-agents write and evolve Rust code to solve the NP-Hard "Reverse Game of Life" problem. The experiment spontaneously evolved three optimization paradigms: causal analysis, SAT solving, and brute force simulation. Ultimately, a brute-force variant named Sigma, using bit-slicing and simulated annealing, reached a score of 378/400 and mathematically proved that reaching 400/400 is impossible under the given constraints.
Related event: GenOS: Multi-Agent Framework Evolves Rust Code to Tackle NP-Hard Problems(2 posts)→
More from coding & agent
- Delegate Pattern in Practice: Have Fable Spawn 5 Opus Workers to Iterate UI Designs — kevinkern · 2026-08-20
- Rich Sutton Interview: Critiques Synthetic Data, Aims to Build 20W Trillion-Param Agent — RichardSSutton · 2026-08-20
- GitHub Commits Surge to 1.4B/Month as Cursor Launches Origin Code Hosting — krishnan · 2026-08-20
- Joke becomes reality: Cursor Origin mirrors 'fork caching' concept — willccbb · 2026-08-20
- Reality Check skill keeps agents on track and reduces hallucinations — doodlestein · 2026-08-20
- VSIINK: Using Unicode Variation Selectors for Invisible Ink Encoding — Singularity_Warrant0 · 2026-08-20