Multi-agent tree search: pooling discoveries can scale returns as N²
Hidenori8Tanaka · x · 2026-10-14
Hidenori Tanaka adds detail to his "Ecology of AI Agents" work: multiple AI agents can explore different branches of a search tree in parallel. For a population of N individuals, pooling distinct work gives capability C(N) proportional to N, while reusing discoveries across individuals can push C(N) to N(N−1) ≈ N² — returns scale quadratically with population. In the quoted tweet he cites Allee and Bowen's 1932 goldfish experiment, where collective survival time exceeded that of isolated fish.
More from coding & agent
- PowerShell demo shows AI workflow to classify, rank and route requests — dfinke · 2026-10-15
- Expand Fetch launches: agents see the web, hits 74% vs Exa's 55% on hard extraction benchmark — bclavie · 2026-10-15
- Agent breaks prod, then fixes it itself: 502, Coolify logs, self-recovery — tristanbob · 2026-10-15
- With zero motion design background, dev crafts Apple-style launch film in 3 days using Opus 5.5 — Glittering-Art3723 · 2026-10-15
- iMCP 1.7.0 adds HomeKit control, voicemail transcripts, and editable Reminders for Mac MCP — pcuenq · 2026-10-15
- Snowflake FDE Podcast: Same Model, 25% to 85% Accuracy — Inside Frontier Engineering — ivory_tang · 2026-10-15