I don't have an example of somewhere where this would be needed. But take Kakariko village in Alttpr, for instance.
It has 12 locations (I think) which are logically equivalent (that is: all locations expect for sick boy, which requires a bottle).
Considering these a single location with 12-item capacity doesn't have an effect on the distribution. But it reduces the search space by a factor of nearly 500 millions. Provided we translate this 12-item capacity property into a formula which doesn't allow all 500 millions shuffles as distinct (see also #10 ).
It would then be up to the client to shuffle items in this location among the chest, which is very very fast, compared to going through 500 millions formulas.
This requires declaring locations as in #11 .
I don't have an example of somewhere where this would be needed. But take Kakariko village in Alttpr, for instance.
It has 12 locations (I think) which are logically equivalent (that is: all locations expect for sick boy, which requires a bottle).
Considering these a single location with 12-item capacity doesn't have an effect on the distribution. But it reduces the search space by a factor of nearly 500 millions. Provided we translate this 12-item capacity property into a formula which doesn't allow all 500 millions shuffles as distinct (see also #10 ).
It would then be up to the client to shuffle items in this location among the chest, which is very very fast, compared to going through 500 millions formulas.
This requires declaring locations as in #11 .