English

Codenames as a Benchmark for Large Language Models

Artificial Intelligence 2025-04-23 v2 Computation and Language

Abstract

In this paper, we propose the use of the popular word-based board game Codenames as a suitable benchmark for evaluating the reasoning capabilities of Large Language Models (LLMs). Codenames presents a highly interesting challenge for achieving successful AI performance, requiring both a sophisticated understanding of language, theory of mind, and epistemic reasoning capabilities. Prior attempts to develop agents for Codenames have largely relied on word embedding techniques, which have a limited vocabulary range and perform poorly when paired with differing approaches. LLMs have demonstrated enhanced reasoning and comprehension capabilities for language-based tasks, but can still suffer in lateral thinking challenges. We evaluate the capabilities of several state-of-the-art LLMs, including GPT-4o, Gemini 1.5, Claude 3.5 Sonnet, and Llama 3.1, across a variety of board setups. Our results indicate that while certain LLMs perform better than others overall, different models exhibit varying emergent behaviours during gameplay and excel at specific roles. We also evaluate the performance of different combinations of LLMs when playing cooperatively together, demonstrating that LLM agents are more generalisable to a wider range of teammates than prior techniques.

Keywords

Cite

@article{arxiv.2412.11373,
  title  = {Codenames as a Benchmark for Large Language Models},
  author = {Matthew Stephenson and Matthew Sidji and Benoît Ronval},
  journal= {arXiv preprint arXiv:2412.11373},
  year   = {2025}
}

Comments

12 pages, 2 figures, 2 tables

R2 v1 2026-06-28T20:36:07.619Z