“…Among the most efficient MPS algorithms are patch‐based methods, whereby instead of simulating a single node from a probability model, entire patterns are pasted into the simulation grid. Several algorithms have been developed to accomplish this [ Chatterjee et al ., ; Honarkhah and Caers , ; Mahmud et al ., ; Rezaee et al ., ; Tahmasebi et al ., ; Tahmasebi et al ., ; Zhang et al ., ]. They offer significant computational gains but tend to have a lower patterns diversity than pixel‐based methods [ Mahmud et al ., ; Tan et al ., ], which is problematic for applications where sweeping a wide model space is important [ Caers , ], such as inverse problems [ Laloy et al ., ; Lochbühler et al ., ; Saibaba and Kitanidis , ].…”