alt Hacker Newshave built in this space which led me to develop a minizinc mcp server [0] for scheduling bocce tournaments [1]. scheduling with constraints is a np hard problem and it makes sense people struggle. tools exist to solve this problem but they are complex and hard to use for non technical folks, and even technical folks. am hoping a tool like this can bridge the gap and would like to bring it to your awareness if you aren't already thinking about the problem this way :)
edit: after reading a bit more of description looks like yall are taking a similar approach, kudos!
This is awesome! Completely agree: modeling each real life scenario as a constraint satisfaction problem is tricky in and of itself (especially with the diversity of non-intersecting constraints we encounter) and something we are actively working on. Using LLMs as a layer above has made it much more tractable. Curious how the bocce scheduling has fared in real world scenarios. How was the performance?