Commit 3ec49837 by dave griffiths

### added recursion steps

parent 272b8b9c
 from dbscode_minecraft import * bulldoze() def row(pos,count): if count>0: box(SANDSTONE,pos,point(1,1,1)) row(pos+point(3,0,0),count-1) row(point(0,0,0),5)
 from dbscode_minecraft import * bulldoze() def tree(pos,count): if count>0: box(SANDSTONE,pos,point(1,count,1)) tree(pos+point(-1,count,0),count-1) tree(pos+point(1,count,0),count-1) tree(point(0,0,0),5)
 from dbscode_minecraft import * bulldoze() def tree(pos,count): if count>0: box(SANDSTONE,pos,point(1,count,1)) tree(pos+point(-1,count,0),count-1) tree(pos+point(1,count,0),count-1) tree(pos+point(0,count,-1),count-1) tree(pos+point(0,count,1),count-1) tree(point(0,0,0),5)
 from dbscode_minecraft import * bulldoze() def tree(pos,count): if count>0: box(SANDSTONE,pos,point(1,count,1)) tree(pos+point(-2,count,0),count-1) tree(pos+point(2,count,0),count-1) tree(pos+point(0,count,-2),count-1) tree(pos+point(0,count,2),count-1) tree(point(0,0,0),5)
 from dbscode_minecraft import * bulldoze() def tree(pos,d,count): if count>0: box(SANDSTONE,pos,d+point(1,1,1)) tree(pos+d,point(-2,0,0),count-1) tree(pos+d,point(2,0,0),count-1) tree(pos+d,point(0,2,0),count-1) tree(point(0,0,0),point(0,1,0),5)
 from dbscode_minecraft import * bulldoze() def chance(percent): return random_range(0,100)0: box(SANDSTONE,pos,d+point(1,1,1)) if chance(50): tree(pos+d,point(-2,0,0),count-1) if chance(50): tree(pos+d,point(2,0,0),count-1) if chance(50): tree(pos+d,point(0,2,0),count-1) tree(point(0,0,0),point(0,1,0),8)
 from dbscode_minecraft import * bulldoze() def chance(percent): return random_range(0,100)0: box(SANDSTONE,pos,d+point(1,1,1)) if chance(50): tree(pos+d,point(-2*count,0,0),count-1) if chance(50): tree(pos+d,point(2*count,0,0),count-1) if chance(50): tree(pos+d,point(0,2*count,0),count-1) tree(point(0,0,0),point(0,1,0),8)
 from dbscode_minecraft import * bulldoze() def chance(percent): return random_range(0,100)0: box(SANDSTONE,pos,d+point(count,count,count)) if chance(50): tree(pos+d,point(-4*count,0,0),count-1) if chance(50): tree(pos+d,point(4*count,0,0),count-1) if chance(50): tree(pos+d,point(0,0,-4*count),count-1) if chance(50): tree(pos+d,point(0,0,4*count),count-1) if chance(50): tree(pos+d,point(0,4*count,0),count-1) tree(point(0,0,0),point(0,1,0),7)
 from dbscode_minecraft import * bulldoze() def chance(percent): return random_range(0,100)0: box(AIR,pos,d+point(count,count,count)) if chance(50): tree(pos+d,point(-4*count,0,0),count-1) if chance(50): tree(pos+d,point(4*count,0,0),count-1) if chance(50): tree(pos+d,point(0,0,-4*count),count-1) if chance(50): tree(pos+d,point(0,0,4*count),count-1) if chance(50): tree(pos+d,point(0,-4*count,0),count-1) box(SANDSTONE,point(-100,-101,-100),point(200,100,200)) tree(point(0,0,0),point(0,-5,0),5)
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment