# Trying to solve a puzzle

**URL:** <https://discourse.julialang.org/t/trying-to-solve-a-puzzle/61515>\
**Category:** Optimization (Mathematical)\
**Created:** [May 20, 2021, 1:05pm UTC](https://discourse.julialang.org/t/trying-to-solve-a-puzzle/61515 "2021-05-20T13:05:25Z")\
**Posts on this page:** 1\
**Showing post:** 11

<div class="post-metadata">

**Author:** ![MarcMush](https://sea2.discourse-cdn.com/julialang/user_avatar/discourse.julialang.org/marcmush/32/18006_2.png) [@MarcMush](https://discourse.julialang.org/u/MarcMush)\
**Post date:** [May 20, 2021, 7:13pm UTC](https://discourse.julialang.org/t/trying-to-solve-a-puzzle/61515/11 "2021-05-20T19:13:51Z")

</div>

if you have `isCovered >= sum(isAntenna)`, your solver will say,  
“ok, isAntenna = 0 everywhere and isCovered = 1 everywhere”

which is of course not want we want (although coverage without antennas would be great 😃)

there is proper maths explanations to transform `and` and `or` into linear constraints but I couldn’t explain the proper maths theory

---

_[View the full topic](https://discourse.julialang.org/t/trying-to-solve-a-puzzle/61515)._