ALE-Agent
Domain-guided tabu best-first search with 30 sibling branches and three-turn solution refinement.
# ALE-Agent full Method 1&2 defaults from the ALE-Bench paper.
seed: 0
general:
# The paper used a wall-clock limit and generated roughly 1,000 programs rather than fixing this
# count. Galapagos uses an explicit deterministic iteration budget; 1,000 is the reported scale.
max_iterations: 1000
mutation_approach: full_rewrite
inner_retry_times: 1
selection_policy:
ale_children_per_parent: 30
ale_refinement_turns: 3
prompt_builder:
ale_domain_guidance: true
# The full breadth-search ablation omits trajectory history to preserve sibling diversity.
ale_include_history: false
memory:
ale_history_size: 12
proposer:
max_tokens: 30000