I've recently gotten really into a real-world territory capture game called Payphone Tag, so I wrote up a blog post explaining how constraint optimisation tools like Google's OR-Tools (specifically the CP-SAT) solver can generate an optimal route that lets you capture as many payphones as possible on a run.
Thought the HN crowd might find it interesting.
