Decision trees

Experiments queued by what earlier ones found. Each branch is a rule written before the runs began; when a run finishes, the conductor applies its node's rules and queues what the first rule that holds names. Solid edges are branches taken; red marks paths that will not run, dashed where a rule did not hold and solid into a run that failed.