Min = required count. Value = what one piece is worth to you (e.g. real cargo capacity) — the solver maximises TOTAL value, so it mixes module types by what they contribute, not by piece count. Max caps a valued module; with Min<Max every count is tried and an extra piece is only kept when it beats the filler value it displaces. Modules with value 0 are placed exactly Min times.
| Module | Shape | Min required |
Max blank = ∞ |
Value per piece |
|---|