01 // PROJECT AT A GLANCE
DUO STUMPER 2
CSearching for a word in a letter grid, in one day and in a pair.
The game of Boggle: a grid of letters, and you have to say whether a word can be formed by moving from cell to adjacent cell. The program offers two modes — checking a word given as an argument, or launching an interactive game where the player types their words.
A Boggle implementation in C: square grid of configurable size (4 by default), word search by backtracking over orthogonally adjacent cells with a stack of already-used positions, and an interactive keyboard mode.
PRIMARYC
DELIVERY2-PERSON TEAM
VERIFICATIONCriterion
SOURCEINSPECTOR READY
03 // KEY OUTCOMES
- Backtracking hand-written with its own stack of visited positions as a linked list
- Half the grade on robustness: options, grid size and player proposals all validated
BEYOND THE BRIEF
- An explicit stack instead of recursion, an unusual choice that removes any risk of stack overflow on a large grid
- Criterion tests despite the timed format
04 // SOURCE TREE
READING SOURCE…