DYNOMIGHT INTERNET NEWSLETTER β’ 968 implied HN points β’ 15 Jan 26
- The horse-enclosure puzzle can be encoded as an integer program using binary variables for walls and for whether a tile can escape, with linear constraints that enforce adjacency and boundaries, so solvers can quickly find and certify optimal enclosures.
- Integer programming is a hugely practical and powerful tool for discrete optimization: even though itβs NP-hard in theory, modern solvers solve many real-world instances very fast and reliably.
- Whether a combinatorial problem is fun depends on legibility and the right level of difficulty, and many NP-complete problems can be made engaging with a good interface; itβs not obvious whether this specific puzzle is provably NP-complete.