(yes they aren't strictly hexagons)
i threw everything at the wall here.
hexagonal radius of 9, costs between 1 and 5 (plus free square), stumps enabled, points constrained 2 cells from each corner to have a minimum cost from center of 10 or 20, and costs of 1 and 5 respectively. there must be $1 cells with minimum costs from 1 to 10, and the total cost of a symmetrical segment must equal 150. the count of $n cells must be $1 ≥ $2 + 2 ≥ etc. this shows the minimum costs; actual costs are in increasing intensity of color.
here's the code if you want to mess around. you'll also need to install picosat. https://eaguru.guru/t/hex_problem.py — cnf.py has the cleanest code, z0.py is okay, hex_problem.py is pretty sloppy.
Cybrespace is an instance of Mastodon, a social network based on open web protocols and free, open-source software. It is decentralized like e-mail.