treedef

From Minetest Developer Wiki
Jump to: navigation, search

Table {axiom =, rules_a =, rules_b =, rules_c =, rules_d =, trunk =, leaves =, leaves2 =, leaves2_chance =, angle =, iterations =, random_level =, trunk_type =, thin_branches =, fruit =, fruit_chance =, seed =}

  • axiom — (string) initial tree axiom
  • rules_a — (string) rules set A
  • rules_b — (string) rules set B
  • rules_c — (string) rules set C
  • rules_d — (string) rules set D
  • trunk — (string) trunk node name
  • leaves — (string) leaves node name
  • leaves2 — (string) secondary leaves node name
  • leaves2_chance — (num) chance (0-100) to replace leaves with leaves2
  • angle — (num) angle in deg
  • iterations — (num) max # of iterations, usually 2 -5
  • random_level — (num) factor to lower nr of iterations, usually 0 - 3
  • trunk_type — (string) one of the following:
  • "single" — 1 node
  • "double" — 2x2 nodes
  • "crossed" — 3x3 nodes in cross shape
  • thin_branches — (boolean) true -> use thin (1 node) branches
  • fruit — (string) fruit node name
  • fruit_chance — (num) chance (0-100) to replace leaves with fruit node
  • seed — (num) random seed

Notes

Personal tools
Namespaces

Variants
Actions
Navigation
API
Toolbox