paper-with-me

Papers

Play to Grade: Testing Coding Games as Classifying Markov Decision Process

2021-10-27 · NeurIPS 2021 12 · Allen Nie, Emma Brunskill, Chris Piech

Contemporary coding education often presents students with the task of developing programs that have user interaction and complex dynamic systems, such as mouse based games. While pedagogically compelling, there are no contemporary autonomous methods for providing feedback. Notably, interactive programs are impossible to grade by traditional unit tests. In this paper we formalize the challenge of providing feedback to interactive programs as a task of classifying Markov Decision Processes (MDPs). Each student's program fully specifies an MDP where the agent needs to operate and decide, under reasonable generalization, if the dynamics and reward model of the input MDP should be categorized as correct or broken. We demonstrate that by designing a cooperative objective between an agent and an autoregressive model, we can use the agent to sample differential trajectories from the input MDP that allows a classifier to determine membership: Play to Grade. Our method enables an automatic feedback system for interactive code assignments. We release a dataset of 711,274 anonymized student submissions to a single assignment with hand-coded bug labels to support future research.

📄 PDF Abstract BibTeX arXiv:2110.14615

Code (1)

windweller/play-to-grade 공식 구현 pytorch

Similar Papers 제목 키워드 기반

Play to Grade: Grading Interactive Coding Games as Classifying Markov Decision Process

2021-01-01 · Allen Nie, Emma Brunskill, Chris Piech

Contemporary coding education often present students with the task of developing programs that have user interaction and complex dynamic systems, such as mouse based games. While pedagogically compelling, grading such st…

Automated Playtesting of Matching Tile Games

2019-07-15 · Luvneesh Mugrai, Fernando De Mesentier Silva, Christoffer Holmgård, Julian Togelius

Matching tile games are an extremely popular game genre. Arguably the most popular iteration, Match-3 games, are simple to understand puzzle games, making them great benchmarks for research. In this paper, we propose dev…

Game Design

AI for Games in the Foundation Model Era

2026-09-15 · Meng Luo, Yanlin Li, Hao Li, Hongzhan Lin 외 arxiv

Foundation models, alongside advances in learned game-world models, are reshaping AI across the game lifecycle. Beyond playing games, recent systems model players and game dynamics, support design and development, adapt …

Concise QBF Encodings for Games on a Grid (extended version)

2023-03-29 · Irfansha Shaik, Jaco van de Pol

Encoding 2-player games in QBF correctly and efficiently is challenging and error-prone. To enable concise specifications and uniform encodings of games played on grid boards, like Tic-Tac-Toe, Connect-4, Domineering, Pu…

The Benefits of Coarse Preferences

2022-01-25 · Joseph Y. Halpern, Yuval Heller, Eyal Winter

We study the strategic advantages of coarsening one's utility by clustering nearby payoffs together (i.e., classifying them the same way). Our solution concept, coarse-utility equilibrium (CUE) requires that (1) each pla…

Clustering