I got it for slightly cheaper but with almost twice as many cycles. I also use a technic I call "storage". it's similar to the easiest way to do Sort but in reverse.
{"displayName":"Carpet","levelName":"FractalCarpet","solution":{"objectSize":7,"objectData":[2,5,0,6,0,0,0,0,5,0,2,0,3,0,3,5,0,1,0,1,-1,4,6,0,5,0,1,-1,11,9,0,3,0,1,0,1,5,0,3,0,1,0,11,0,0,3,0,1,0,11,6,0,1,0,2,0,11,7,0,3,0,1,0,11,1,0,3,0,0,0,10,0,0,2,0,3,0,6,0,0,2,0,3,0,2,0,0,2,0,3,0,11,11,0,2,0,3,1,1,11,0,5,0,3,2,2,11,0,1,0,1,2,3,11,0,3,0,1,2,4,11,0,3,0,1,2,5,11,0,3,0,0,2,5,10,0,3,0,0,2,5,9,0,3,0,3,2,4,9,0,3,0,3,2,3,9,0,3,0,2,2,3,10,0,3,0,1,2,4,10,0,5,0,1,1,4,8,0,2,0,0,0,9,11,0,9,0,0,0,4,5,0,5,0,0,3,5,6,0,1,0,1,3,9,9,0,2,0,0,0,7,7,0,2,0,3,0,3,7,0,2,0,3,0,1,6,0,1,0,0,0,5,5,0,1,0,1,3,6,4,0,2,0,0,0,4,1,0,2,0,3,0,6,3,0,2,0,0,0,4,2,0,2,0,3,0],"solutionName":"New Solution","levelVersion":0,"completed":true,"cycles":92,"cost":38}}