Greedy Placement with Constraints

Place the most constrained item first—smallest domain often works.

Try this in Python

intervals = [(0, 2), (1, 3), (3, 4)]
intervals.sort(key=lambda x: x[1])
print(intervals[0])

Key takeaways

• Constraint propagation is greedy on CSP lite.
• Grid problems: scan order matters.
• Avoid floating compare without epsilon if geometry.