Failed experiment with greedy subdivision of stamps. Less drawCount but same speed :-(
Testing greedy subdivision to reduce drawCount Greedy subdivision is a method used reduce drawcount. Eg: If you want to stamp the same tile repeatedly x# times. You stamp highest divisible number. 1,2,4,8,16 logarithmically. Eg: To stamp the same tile 35 times, you only need to stamp 4 times with the greedy method eg: 16, 16, 2, 1 rather than 35 times. Bayer only uses 16 values for fill with 5 sizes is 80 extra costumes. Unfortunately due to the extra branching logic and assignments it is around the same speed :-( Is there a better method? Updated images/list to @nakakouTV v5 4x4 grid https://scratch.mit.edu/projects/1270470353
