I need help making a recursive Koch snowflake. Im using python. I needed to make a snowflake that uses 6 recursions. I did that part, the part Im having trouble with is coloring each of recursions a different color. here is what I have so far. //-------------koch snowflake void setup() { size(600, 600); background(255); stroke(0); //frameRate(1); //colorMode(HSB, 8, 100, 100); } int i = 1; void draw() { Koch(width/2, height/2, width*0.7, i); } void Koch(float X, float Y, float D, int order) { colorMode(HSB, 8, 100, 100); fill(0, 128/order, 128); pushMatrix(); translate(X, Y); translate(-D/2, D/3*sin(PI/3)); Koch(D, order); translate(D, 0); rotate(-2*PI/3); Koch(D, order); translate(D, 0); rotate(-2*PI/3); Koch(D, order); popMatrix(); } void Koch(float X, int order) { if (order == 1) { order++; Koch(X/3, order); pushMatrix(); translate(X/3, 0); rotate(PI/3); Koch(X/3, order); translate(X/3, 0); rotate(-2*PI/3); Koch(X/3, order); translate(X/3, 0); rotate(PI/3); Koch(X/3, order); popMatrix(); } if (order == 2) { order++; Koch(X/3, order); pushMatrix(); translate(X/3, 0); rotate(PI/3); Koch(X/3, order); translate(X/3, 0); rotate(-2*PI/3); Koch(X/3, order); translate(X/3, 0); rotate(PI/3); Koch(X/3, order); popMatrix(); } if (order == 3) { order++; Koch(X/3, order); pushMatrix(); translate(X/3, 0); rotate(PI/3); Koch(X/3, order); translate(X/3, 0); rotate(-2*PI/3); Koch(X/3, order); translate(X/3, 0); rotate(PI/3); Koch(X/3, order); popMatrix(); } if (order == 4) { order++; Koch(X/3, order); pushMatrix(); translate(X/3, 0); rotate(PI/3); Koch(X/3, order); translate(X/3, 0); rotate(-2*PI/3); Koch(X/3, order); translate(X/3, 0); rotate(PI/3); Koch(X/3, order); popMatrix(); } else { order = order - 1; beginShape(); vertex(0, 0); vertex(X/3, 0); vertex(X/2, X/3*sin(PI/3)); vertex(2*X/3, 0); vertex(X, 0); endShape(); } } Solution Try to implement in.