Combinatorial search

DFS — constraint prune.

Try this in Python

# Brute count binary strings length 3 (toy search space)
print(2**3)

Key takeaways

• State tuple consistent.
• Memo repeats.
• Branch estimate.