| 1 | # The idea is that except if we have less than 11 sticks where the solution is trivial |
| 2 | # in every other case we create as much pairs of hexagons as possible. The addition of |
| 3 | # two pairs provides the best solution and also return to us 3 sticks. We repeat until |
| 4 | # no new pairs can be created. Then with less than 11 sticks we can add 2 new hexagons |
nothing calls this directly
no test coverage detected