Game ideals with simple scrambling tools

Determine whether a game ideal with a simple scrambling tool is genuinely different from an ordinary game ideal.

Background

The paper proves that Farah–Zapletal ideals are precisely game ideals with a simple scrambling tool together with the universality property for countable elementary submodels. The authors explain that the distinction concerns whether Player II’s information is masked and explicitly leave open whether the two classes actually differ.