✳flâneur — a map of the web's best reading
Integer programming easily encloses horse
dynomight.substack.com · 2,104 words · saved by 1 readers
Stop having fun without me
Integer programming easily encloses horse Stop having fun without me Jan 15, 2026 85 36 3 Share enclose.horse is a game in which you enclose a horse. You start with a map like this with water, fields, and horse. Then you enclose horse. You have a finite budget of walls. (For the above map, 13.) You need to place them so that the horse is enclosed in as large an area as possible. The horse cannot move diagonally and cannot move over water. Here’s one (bad) solution: This is a charming little game. But something about it disturbs me. It’s exploring a mathematical structure (good) but it’s a diso
Explore this link on the map →saved by
related reading
- Knapsack problem - Wikipediaen.wikipedia.org
- Problem solving is often a matter of cooking up an appropriate Markox chainmath.uchicago.edu
- What's new | Updates on my research and expository papers, discussion of open problems, and other maths-related topics. By Terence Taoterrytao.wordpress.com
- Rectangle packing - Wikipediaen.wikipedia.org
- Jane Street Blog - Can you reverse engineer our neural network?blog.janestreet.com
- Shtetl-Optimized >> Blog Archive >> Ten Signs a Claimed Mathematical Breakthrough is Wrongscottaaronson.blog
- Minesweeper is NP-complete.academic.timwylie.com
- GitHub - konstin/sudoku-in-python-packaging: Sudoku solving in python packaging · GitHubgithub.com
- P versus NP problem - Wikipediaen.wikipedia.org
- Many Hard Leetcode Problems are Easy Constraint Problems • Buttondownbuttondown.com
- Computational Complexityblog.computationalcomplexity.org
- Complexity of Tiling a Polygon with Trominoes or Bars | Discrete & Computational Geometry | Springer Nature Linklink.springer.com