arXiv (All)
open access
Modular Discovery of General Game-Playing Algorithms with Large Language Models
General Game Playing across arbitrary games from rules alone remains challenging due to differing algorithmic requirements across game classes and strict decision-time constraints. Rather than hand-designing search heuristics for specific domains, can we leverage Large Language Models (LLMs) to disc
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Beyond Prompt or Skill? Attribution-Guided Optimization of Modular LLM Programs#1116823
- ATLAS: Discovering Agent Strategies through LLM-Guided Abstraction and Automata Learning#458282
- UniACE: A Unified Framework for Evaluating LLM Agentic Capabilities#820473
- PlayWorld: Benchmarking World Models with Agent Players over Long-Horizon Objectives#455597
- AgentFactory: Towards Automated Agentic System Design and Optimization#821032
Record · ID 1117827
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive