dyigitpolat

it was very easy to support the portal mechanism when the entire problem is mapped as a network flow optimization. i could just simply add the portal coordinates together with the neighbors.

MILP solver: https://github.com/dyigitpolat/enclose-horse-solver/blob/mai...

try at: https://dyigitpolat.github.io/enclose-horse-solver/

just vibe-coded an optimizer for the game enclose.horse that takes in the screenshot of the grid and the number of walls as input, and spits out the optimal wall configuration (supports cherries too!)

algorithm:

1. infer grid dimensions

2. color histogram analysis to designate grasses, water, cherries and horse

3.0. register game mechanics as optimization constraints (cannot place on cherries, cannot move over walls and waters etc.)

3.1. apply mixed-integer linear programming to determine optimized wall placements

4. profit!

try: https://dyigitpolat.github.io/enclose-horse-solver

source: https://github.com/dyigitpolat/enclose-horse-solver

just vibe-coded an optimizer for this game that takes in the screenshot of the grid and the number of walls as input, and spits out the optimal wall configuration (supports cherries too!)

algorithm:

1. infer grid dimensions

2. color histogram analysis to designate grasses, water, cherries and horse

3. apply mixed-integer linear programming to determine optimized wall placements

4. profit!

try: https://dyigitpolat.github.io/enclose-horse-solver

source: https://github.com/dyigitpolat/enclose-horse-solver