Seems like it could be quite time consuming to work out that one talk is asking the impossible or a pair are mutually incompatible, so maybe just a git bisect kind of tool that shows you how many talks can be scheduled before it breaks?
Ideally, pointing to the talk that broke a particular constraint each time would be nice.
Seems like it could be quite time consuming to work out that one talk is asking the impossible or a pair are mutually incompatible, so maybe just a git bisect kind of tool that shows you how many talks can be scheduled before it breaks?
Ideally, pointing to the talk that broke a particular constraint each time would be nice.