Graham Todd

Graham Todd

Auto-generated profile, based on publicly available information

Graham Todd

New York University Tandon, Brooklyn, NY, USA

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
12 April 2023
Verified
Conference Paper
Open access
GTGraham Todd
Graham Todd
SESam Earle
Sam Earle
MNMuhammad Umair Nasir
Muhammad Umair Nasir
MGMichael Cerny Green
Michael Cerny Green
JTJulian Togelius
Julian Togelius
Large Language Models (LLMs) are powerful tools, capable of leveraging their training on natural language to write stories, generate code, and answer questions. But can they generate functional video game levels? Game levels, with their complex functional constraints and spatial relationships in more than one dimension, are very different from the kinds of data an LLM typically sees during training. Datasets of game levels are also hard to come by, potentially taxing the abilities of these data-hungry models. We investigate the use of LLMs to generate levels for the game Sokoban, finding that LLMs are indeed capable of doing so, and that their performance scales dramatically with dataset size. We also perform preliminary experiments on controlling LLM level generators and discuss promising areas for future work.

31 July 2025 in IEEE Transactions on Games
Verified
Journal Article
Closed access
GTGraham Todd
Graham Todd
TMTim Merino
Tim Merino
SESam Earle
Sam Earle
JTJulian Togelius
Julian Togelius
The Connections puzzle published each day by the New York Times tasks players with dividing a bank of sixteen words into four groups of four words that each relate to a common theme. Solving the puzzle requires both common linguistic knowledge (i.e. definitions and typical usage) as well as, in many cases, lateral or abstract thinking. This is because the four categories ascend in complexity, with the most challenging category often requiring thinking about words in uncommon ways or as parts of larger phrases. We investigate the capacity for automated AI systems to play Connections and explore the game's potential as an automated benchmark for abstract reasoning and a way to measure the semantic information encoded by data-driven linguistic systems. In particular, we study both a sentence-embedding baseline and modern large language models (LLMs). We report their accuracy on the task, measure the impacts of chain-of-thought prompting, and discuss their failure modes. We further extend our experiments to include the recently released o1-family LLMs, which demonstrate significant improvements in this domain. Overall, we find that the Connections task is challenging yet feasible, and a strong test-bed for future work.