# .font: font.text_2
2019-11-11 17:26 nesdori  
# .font: font.text_1
 Arno , so this is the intended solution, nice demo. i was looking for a solution where every bfly is converted into 9 diamonds and i had entirely different solution in my mind :)

# .font: font.text_2
2019-11-11 18:50 Arno  
# .font: font.text_1
yes, this is the way how schlonkel (the author) plays it too. but i had the feeling that there are alternative solutions, with more \ :-)

# .font: font.text_2
2019-11-12 12:58 dustin  
# .font: font.text_1
hmmm... couldn't the amoeba be trapped into a bigger cage?

# .font: font.text_2
2019-11-12 13:07 nesdori  
# .font: font.text_1
it could but its limit is less than 200 (about 70), i didn't check if  Arno 's solution used the full limit but probably the author has set it based on his intended solution.

# .font: font.text_2
2019-11-12 13:25 Arno  
# .font: font.text_1
amoeba limit is 69. if my counts are correct, the intended solution indeed uses the full limit. :-)