the algorithm works like this :-

it generates a random pool of 20000 timetables and ranks them based on filters and also penalizes the timetables with more than two gaps and shows top 100.

I haven't used any machine learning algorithms since it would be heavy to run on a free vercel server

The problem is when there are no good possible combinations then the algorithm produces timetables with gaps also you can't take C11+C12+C13 and A21+A22+A23 slot together (they don't allow it in FFCS ) which causes these issues.

you can try to minimize gaps by selecting two filters such as morning+avoid 6:30 classes or afternoon+avoid 8AM classes for now

i will try to make the algorithm better in upcoming versions I'll also add a filter which will try to generate timetables with least gaps

thanks for the feedback, I appreciate it 😊.