Shaurya Verma

Project

Wordle Solver

A letter-constraint solver that narrows Wordle guesses, giving me my first taste of search.

Built for a YoungWonks hackathon; narrows possible answers using letter logic. An early algorithmic project that connects directly to later search work like Tic Tac Go.

Why I built it

Wordle was everywhere, and the constraint system behind it was more interesting to me than guessing from intuition. I built the solver during a YoungWonks hackathon as a first attempt at turning those rules into code.

What it does

The solver accepts known letters, excluded letters, and position constraints, then narrows a word list to plausible answers for the next guess.

Why it matters

It was an early bridge between building interfaces and thinking algorithmically. The project is much smaller than Tic Tac Go, but the same instinct is visible: represent the rules clearly, reduce the search space, and show a useful answer.

Under the hood

  • Python applies positional and membership constraints to candidate words.
  • Flask exposes the solver through a small web interface.
  • The filtering process keeps each clue explicit rather than relying on a black-box model.

Related work