ARIADNE: Agentic Reward-Informed Adaptive Decision Exploration via Blackboard-Driven MCTS for Competitive Program Generation
Minnan Wei, Xiang Chen, Xiaoshuai Niu, Siyu Chen

TL;DR
This paper introduces ARIADNE, a blackboard-driven MCTS framework that improves competitive program generation by modeling it as a sequential decision process with structured evidence accumulation.
Contribution
ARIADNE's novel blackboard-driven MCTS approach enables systematic exploration and effective feedback use, outperforming existing methods in competitive programming benchmarks.
Findings
Achieves up to 26.06 points higher Pass@1 scores than baseline methods.
Consistently outperforms strong baselines across four benchmarks.
Effectively utilizes execution feedback within limited computational budgets.
Abstract
Competitive program generation aims to automatically produce correct and efficient solutions for programming-contest problems under strict time and memory constraints. Existing LLM-based approaches often fail to perform explicit algorithmic planning and to handle edge cases robustly, leading to unreliable one-shot generation. Moreover, although execution feedback is essential for iterative debugging and refinement, incorporating such feedback effectively within limited computational budgets remains difficult. To overcome these limitations, we propose {\tool}, a blackboard-driven Monte Carlo Tree Search (MCTS) framework that models program generation as a sequential decision process. {\tool} organizes the generation workflow into five coordinated stages (i.e., strategy selection, code generation, test generation, quality evaluation, and code repair) while maintaining a shared blackboard…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
