Weighted Sum V1 vs Weighted Sum V2

Thank you for your clarification.

I now understand the logic behind V1 and V2 (fingers crossed).
For V1:
While the Min/Max value of the total weighted sum is satisfied,
return the item if the sum of any modifier conditions meets the requirements.

[Does not ignore the sum value of the condition—each modifier must meet its individual sum(weight * min/max)]

For V2:
While the Min/Max value of the total weighted sum is satisfied,
Return the item if at least one relevant modifier exists on the item in the database.

[Ignores the sum value of individual conditions—an item can qualify even if some affixes are below the min.]

I hope what I understood is correct.

Assuming that it is corret, I'm going to wrap up the post with a question. I'm thinking about an edge case where Min/Max are empty, which causes all items with a sum of 0 to be returned, including irrelevant ones.
"For V1: While the Min/Max value of the total weighted sum is satisfied (or unconstrained), return the item only if the sum <> 0", ensuring that only relevant items are included.



Would this optimize the search better?