Autoresearch for SAT Solvers

github.com
March 19, 2026
5 min read
56/100
Summary
An autonomous AI agent teaches itself to become the world's top expert on MaxSAT by analyzing 229 weighted MaxSAT instances from the 2024 MaxSAT Evaluation. It discovers novel strategies, finds better solutions, and iteratively refines its toolbox without human guidance.
Key Takeaways
- An autonomous AI agent has been developed that teaches itself to excel in solving MaxSAT problems without human guidance.
- The agent solved 220 out of 229 weighted MaxSAT instances from the 2024 MaxSAT Evaluation, achieving optimal solutions for 30 instances.
- The AI discovered novel strategies and improved solutions through iterative experimentation, with one instance solved that had no known solution previously.
- Multiple agents can collaborate on the same repository using Git for version control, allowing them to share findings and build upon each other's work.
Coverage & discussions
Hacker News · github.com
Community discussions
Community Sentiment
Positives
- The work by Prof. Cunxi Yu and his students on improving SAT solvers could significantly advance algorithmic efficiency in computationally challenging areas like chip design.
Concerns
- The absence of Z3 in the MaxSAT 2024 competition raises doubts about the originality of the techniques discovered by the agent, suggesting it may not represent true innovation.
- Concerns about the methodology used in the solver's development indicate that improvements may be more about illusion than genuine algorithmic advancement.
Related Articles

Parallel coding agents with tmux and Markdown specs
Mar 2, 2026

Scaling Karpathy's Autoresearch: What Happens When the Agent Gets a GPU Cluster
Mar 19, 2026

Autoresearch on an old research idea
Mar 23, 2026

Fable 5 vs. GPT-5.6 Sol on an NP-Hard Problem: Does /goal help?
Jul 18, 2026

Research-Driven Agents: When an agent reads before it codes
Apr 9, 2026