A college timetable made in about two seconds, with no clashes, for the way colleges teach under NEP 2020: every lecture, every lab block by batch, and the elective baskets (MDC, AEC, VAC), where all options run at the same time in their own rooms.

It uses a real constraint solver, Google OR-Tools CP-SAT. When no timetable is possible, it says which rules collide, in plain words, and what to change. Click any lecture and every period of the week shows whether it fits there, and if not, why; drag it to move it, then re-solve the rest around it. Excel export, printable timetables per division, teacher and room, and a phone page for students.

Built on a real problem: Smart India Hackathon 2025, statements SIH25028 (Government of Jharkhand) and SIH25091 (Government of Jammu and Kashmir), smart timetables for NEP 2020.

It runs on any laptop with Python, offline, and opens with a sample college (6 divisions, 24 teachers, 14 rooms, 95 meetings), so the demo works the first time.

Keywords: timetable, NEP 2020, constraint programming, OR-Tools, FastAPI, React, Smart India Hackathon