Skip to main content
Puzzling

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

8
  • $\begingroup$ Nice (ab)use of the rules, since we don't need to reach all sprinklers. $\endgroup$
    – Bubbler
    Commented Feb 1, 2021 at 6:31
  • 3
    $\begingroup$ Yes, the 46 example does that, too. $\endgroup$
    – RobPratt
    Commented Feb 1, 2021 at 6:34
  • 1
    $\begingroup$ @DmitryKamenetsky The best bounds I have are $[57,65]$. $\endgroup$
    – RobPratt
    Commented Feb 1, 2021 at 18:31
  • 1
    $\begingroup$ My model converges in 220 seconds proving 57 is optimal. I use a tree structure to define the connection of path tiles, and use lazy constraints to prevent cycles. I think it converges fast mainly because I use gurobi... $\endgroup$
    – xd y
    Commented Apr 16, 2022 at 14:36
  • 1
    $\begingroup$ @xdy Can you please share your formulation in a separate answer? I had tried a few different approaches and would be interested in seeing yours. $\endgroup$
    – RobPratt
    Commented Apr 16, 2022 at 15:10