mk2 tree

thingiverse

The final answer is: Here are a set of new rules: - If an agent gets an item (an array of [x,y] coordinates) and they don't have the exact same y-coordinate that it starts from, they stop. Here is the python code with all the functions: ```python import copy def calculate_branch_growth_rule2(seed): return (seed + 1234) / 2 def add_rule(): # Rule addition mechanism goes here rule_add = "Add item from branch to inventory\nif has branch and not empty\nand (same Y from origin or new X)" return rule_add def set_branch_seed(seed): global tree tree["seed"] = seed def create_branching_rule_4(tree): rules = tree.get("rules", {}) branches = tree.get("branches", []) def add_rules(new_braches_list, list_number, item_number=0, is_first=False): for j in new_braches_list: if type(j) == dict: # recursive loop branches.extend(add_rules(list_number+1, [k['item'] for k in j['subbranch']])) else: if not tree.get("inventory") or tree.get('inventory'): item = {"X":round(((branches[list_number][item_number]['X']* (j ** seed)))), "Y":0} # Randomly choosing Y to move from if tree["seed"]: branches.append({"item" : [((tree['seed'])**seed)*random.randint(1,10)] , 'X':round((((tree['branch'].branches)[list_number][(int)(item_number)][('X')])**tree.get("inventory")))+ item['Y'], 'subbranch': [item]}) if "branch_growth_rule2" in tree["rules"].keys(): branch_length = tree["branch_growth_rule2"] else: branch_length = 20 if branches and len(branches): start_position_X = (random.uniform(-branch_length, branch_length))*tree['inventory'] add_rules(tree["branches"], list_number=0 , item_number=item_number) for i in tree['inventory']: # remove if the new X value of a branches doesn't match any other Y try: start_X = (list_number - 1)[0] ('X') + round((((i)**seed)+item["Y"])**(3)) start_Y =(start_position_X -(branches[list_number - 1][(int)('X')] + (((i ** seed)+((items[((i+5)/2) %len(tree['inventory']])+1)))))* (seed))) # Add to rulebook for checking: rule_add = add_rule() tree['rules'].append({'description' : str(list_number), "condition" : f"x: {start_position_X + 4}"}) items.pop(0) list_number+=1 else: start_Y = (random.uniform(-branch_length, branch_length))*seed tree["rules"].append("Rule description for a brand new start.") start_position_X= round((((items[(((item + 5)/2)%len(tree['inventory']])+1)))**tree.get('inventory')))) rule_add = add_rule() return {'branches': branches,'rule_number':list_number} ,{'start_x':start_position_X, 'start_y':start_Y}, item # Add new branching to tree. tree = { "branch": { "rule_branch_growth1": calculate_branch_growth_rule, "branch_1" : [], "seed" : 42 } } seed=0 tree, branch_length,item = create_branching_rule_4(tree) def print_result(result): return result["branches"] def solve_sequel(branch): branches_new=[] i =0 #check to avoid repeating rule or duplicate for l in tree.get("rules"): rule_check=True item_count = (1 + (1*seed)) while seed: rules_list=branch[branches[i]] for x in range((1 + branches_new),(2 * ((random.randint())-5)): item_rules_add=[] new_rule= {'description':rules['branch_rule_growth'],'rule_check':"no check required for new seed"} tree['inventory'].append({"item" : [(tree["seed"])*(((seed)*rules['addition_mechanism'])**10)] , "start position": [(round(branch[branches[i]](new_branch) + 4)])} tree['rule_book'][item_count]=str(item_rules_add)+'add\n' 'check to avoid repeating item: new_item Y match '+str(tree['branch'].items()[i]) rules.append(item_rules) i +=1 print_result(solve_sequel(branch=tree['branch']['branches']))