### Flower power happy error

During development of Flower power ðŸŒ¼ I forgot to move lines 30 and 31 inside the walk() function and got this nice looking effects. I saved this, forked it and continued on that other Turtle.

```// You can find the Turtle API reference here: https://turtletoy.net/syntax
Canvas.setpenopacity(1);

// Global code will be evaluated once.
const turtle = new Turtle();
const polygons = new Polygons();

const ratios = [[3, 2],[4, 2], [5, 2],[6, 55/30],[7, 53/30],[8, 5/3], [9, 3/2], [10, 44/30], [11, 42/30], [12, 4/3]];

const pi2 = Math.PI * 2;
const nrs = 12;
const innerR = 30;
const outerR = 40;

const add2 = (a, b) => [a[0]+b[0], a[1]+b[1]];
const sub2 = (a, b) => [a[0]-b[0], a[1]-b[1]];
const dist2 = (a, b) => Math.hypot(...sub2(a,b));
const angle2 = (a) => Math.atan2(a[1],a[0]);
const normalize2 = (a) => scale2(a, 1/length2(a));
const length2 = (a) => Math.hypot(...a);
const scale2 = (a,s) => [a[0]*s,a[1]*s];
const transform2 = (matrix, a) => [matrix[0]*a[0]+matrix[2]*a[1], matrix[1]*a[0]+matrix[3]*a[1]];

const pos2 = (angleRatio, radius, start = 0, fullCircle = Math.PI*2) => [Math.cos(start + angleRatio * fullCircle) * radius, Math.sin(start + angleRatio * fullCircle) * radius]
const range = (n, min = 0, max = Math.PI*2) => { while(n < min) n+=max; while(n>max) n-=max; return n; }

const smallR = dist2(pos2(0, innerR), pos2(1/nrs, innerR)) / 3;
const bigR = dist2(pos2(.5/nrs, outerR), pos2(0, innerR)) - smallR;

const drawPt = (a) => { turtle.jump(a[0], a[1]-.2); turtle.circle(.2); }

// The walk function will be called until it returns false.
function walk(i) {
const rm = rotationMatrix2(Math.random()*pi2);

const splat = (Math.random() * ratios.length) | 0;
const innerR = Math.random() * 10 + 30;

const p = polygons.create();
p.addPoints(...getPoints(ratios[splat][0], innerR, innerR * ratios[splat][1]).map(i => transform2(rm, i)));
polygons.draw(turtle, p);

return i < 0;
}

function getPoints(nrs, innerR, outerR) {

const iCenterPosSmall = pos2(0, innerR);
const iCenterPosBig = pos2(.5/nrs, outerR);

const fullSmallCircle = pi2-2*angle2(sub2(iCenterPosBig,iCenterPosSmall));
const fullBigCircle = pi2 - (2 * (angle2(sub2(iCenterPosSmall,iCenterPosBig)) - (angle2(iCenterPosBig)-Math.PI)));

const pts = [];

for(let i = 0; i < nrs; i++) {
const centerPosSmall = pos2(i/nrs, innerR);
const centerPosBig = pos2((i+.5)/nrs, outerR);

const smallStartAngle = angle2(sub2(centerPosBig,centerPosSmall));
const bigStartAngle = angle2(sub2(centerPosSmall,centerPosBig));

for(let j = 40; j >= 0; j--) {
const gotoPos = add2(centerPosSmall, pos2(j/40, smallR, smallStartAngle, fullSmallCircle));
pts.push(gotoPos);
}

for(let j = 0; j <= 40; j++) {
const gotoPos = add2(centerPosBig, pos2(j/40, bigR, bigStartAngle, fullBigCircle));
pts.push(gotoPos);
}
}

return pts;
}

////////////////////////////////////////////////////////////////
// Polygon Clipping utility code - Created by Reinder Nijhoff 2019
// (Polygon binning by Lionel Lemarie 2021)
// https://turtletoy.net/turtle/a5befa1f8d
////////////////////////////////////////////////////////////////
function Polygons(){const t=[],s=25,e=Array.from({length:s**2},t=>[]),n=class{constructor(){this.cp=[],this.dp=[],this.aabb=[]}addPoints(...t){let s=1e5,e=-1e5,n=1e5,h=-1e5;(this.cp=[...this.cp,...t]).forEach(t=>{s=Math.min(s,t[0]),e=Math.max(e,t[0]),n=Math.min(n,t[1]),h=Math.max(h,t[1])}),this.aabb=[s,n,e,h]}addSegments(...t){t.forEach(t=>this.dp.push(t))}addOutline(){for(let t=0,s=this.cp.length;t<s;t++)this.dp.push(this.cp[t],this.cp[(t+1)%s])}draw(t){for(let s=0,e=this.dp.length;s<e;s+=2)t.jump(this.dp[s]),t.goto(this.dp[s+1])}addHatching(t,s){const e=new n;e.cp.push([-1e5,-1e5],[1e5,-1e5],[1e5,1e5],[-1e5,1e5]);const h=Math.sin(t)*s,o=Math.cos(t)*s,a=200*Math.sin(t),i=200*Math.cos(t);for(let t=.5;t<150/s;t++)e.dp.push([h*t+i,o*t-a],[h*t-i,o*t+a]),e.dp.push([-h*t+i,-o*t-a],[-h*t-i,-o*t+a]);e.boolean(this,!1),this.dp=[...this.dp,...e.dp]}inside(t){let s=0;for(let e=0,n=this.cp.length;e<n;e++)this.segment_intersect(t,[.1,-1e3],this.cp[e],this.cp[(e+1)%n])&&s++;return 1&s}boolean(t,s=!0){const e=[];for(let n=0,h=this.dp.length;n<h;n+=2){const h=this.dp[n],o=this.dp[n+1],a=[];for(let s=0,e=t.cp.length;s<e;s++){const n=this.segment_intersect(h,o,t.cp[s],t.cp[(s+1)%e]);!1!==n&&a.push(n)}if(0===a.length)s===!t.inside(h)&&e.push(h,o);else{a.push(h,o);const n=o[0]-h[0],i=o[1]-h[1];a.sort((t,s)=>(t[0]-h[0])*n+(t[1]-h[1])*i-(s[0]-h[0])*n-(s[1]-h[1])*i);for(let n=0;n<a.length-1;n++)(a[n][0]-a[n+1][0])**2+(a[n][1]-a[n+1][1])**2>=.001&&s===!t.inside([(a[n][0]+a[n+1][0])/2,(a[n][1]+a[n+1][1])/2])&&e.push(a[n],a[n+1])}}return(this.dp=e).length>0}segment_intersect(t,s,e,n){const h=(n[1]-e[1])*(s[0]-t[0])-(n[0]-e[0])*(s[1]-t[1]);if(0===h)return!1;const o=((n[0]-e[0])*(t[1]-e[1])-(n[1]-e[1])*(t[0]-e[0]))/h,a=((s[0]-t[0])*(t[1]-e[1])-(s[1]-t[1])*(t[0]-e[0]))/h;return o>=0&&o<=1&&a>=0&&a<=1&&[t[0]+o*(s[0]-t[0]),t[1]+o*(s[1]-t[1])]}};return{list:()=>t,create:()=>new n,draw:(n,h,o=!0)=>{reducedPolygonList=function(n){const h={},o=200/s;for(var a=0;a<s;a++){const c=a*o-100,r=[0,c,200,c+o];if(!(n[3]<r[1]||n[1]>r[3]))for(var i=0;i<s;i++){const c=i*o-100;r[0]=c,r[2]=c+o,n[0]>r[2]||n[2]<r[0]||e[i+a*s].forEach(s=>{const e=t[s];n[3]<e.aabb[1]||n[1]>e.aabb[3]||n[0]>e.aabb[2]||n[2]<e.aabb[0]||(h[s]=1)})}}return Array.from(Object.keys(h),s=>t[s])}(h.aabb);for(let t=0;t<reducedPolygonList.length&&h.boolean(reducedPolygonList[t]);t++);h.draw(n),o&&function(n){t.push(n);const h=t.length-1,o=200/s;e.forEach((t,e)=>{const a=e%s*o-100,i=(e/s|0)*o-100,c=[a,i,a+o,i+o];c[3]<n.aabb[1]||c[1]>n.aabb[3]||c[0]>n.aabb[2]||c[2]<n.aabb[0]||t.push(h)})}(h)}}}

```