Probeable Problems for Beginner-level Programming-with-AI Contests
Mrigank Pawagi, Viraj Kumar

TL;DR
This paper introduces Probeable Problems, a new type of beginner-level programming problem designed to be challenging for AI code-generation tools, encouraging clarification and learning during contests.
Contribution
It proposes a novel problem format that includes deliberate ambiguities and a probing mechanism, tested through a real contest with students using AI tools.
Findings
AI tools struggled with Probeable Problems due to missing details.
Students used clarification questions to resolve ambiguities.
Probeable Problems support learning and engagement in CS education.
Abstract
To broaden participation, competitive programming contests may include beginner-level problems that do not require knowledge of advanced Computer Science concepts (e.g., algorithms and data structures). However, since most participants have easy access to AI code-generation tools, these problems often become trivial to solve. For beginner-friendly programming contests that do not prohibit the use of AI tools, we propose Probeable Problems: code writing tasks that provide (1) a problem specification that deliberately omits certain details, and (2) a mechanism to probe for these details by asking clarifying questions and receiving immediate feedback. To evaluate our proposal, we conducted a 2-hour programming contest for undergraduate Computer Science students from multiple institutions, where each student was an active member of their institution's computing club. The contest comprised…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Evolutionary Algorithms and Applications · Logic, programming, and type systems
