4 ms·

Are you sure you can’t do this with a linear programme? Surely there is a way to encode the line choices, the partitions they create and the number of dots with

Are you sure you can’t do this with a linear programme? Surely there is a way to encode the line choices, the partitions they create and the number of dots within those partitions as a linear programme. Might be fun to try. Edit: Outsourced to codegolf. Had to move the question to the sandbox, as I was unsure on grading. Will update when accepted.

eutectic 6y ago
Well,it is a set cover problem so you can use ILP and mip is actually much faster than z3. I'm sure it's possible (though maybe not easy) to use more geometry. I don't see how to make a simple linear program though.
- jpcooper 6y ago
  Let's see what codegolf comes up with. Link above.