Through taking the excellent CSE 507 class at UW (Solver Aided Programming) I learned about Rosette, a Racket-based programming system that interfaces with SAT/SMT solvers.

I applied Rosette to the problem of generating autogramic pangrams, aka self-enumerating pangrams: sentences that contain every letter of the alphabet AND describe themselves.

The front end (NextJS/Vercel) passes constraints to a Dockerized Rosette program hosted on Cloud Run.

Feedback and comments welcome! And Happy New Year!