Reduce time complexity

We currently use hard-coded limits to schedule a league in a reasonable amount of time and computation. With better logic and propagation we should be able to reduce the time complexity for all cases.

Just how far can we push it into polynomial time for all cases (P = NP)?