Houdini生成地图算法

vector createPoint(int i;vector pos){
    int pt0 = addpoint(i, pos);
    return pos;
}
 
vector aa = {0,0,0};
for(int i=0;i<100000;i++){
    //aa = createPoint(i,aa);
    int pt0 = addpoint(i, aa);
    //int prim0 = addprim(i, "poly");
    float r = rand(i*chi("rand"));
    
    int b = int(fit01(r,0,4));
    //printf("%d",b);
    if(b==0){
        aa.x++;
        continue;
    }
    if(b==1){
        aa.x--;
        continue;
    }
    if(b==2){
        aa.z++;
        continue;
    }
    if(b==3){
        aa.z--;
        continue;
    }
}