Engines

For any address space: * Uses the "directional charms" algorithm that I'm building in Eldritch Library to handle Mouths. * Chunks the address space and gives each fractal chunk its own charm so you don't have to search the entire address space to find a pair. * Have a third variable to the charm that tells it which scale to search through so you still get smaller-scale connections.

[table] 0 | [e]blue[/e] | up 1 | [r]red[/r] | up [i][u]2[/i][/u] | [i][u][r]red[/r][/i][/u] | [i][u]down[/i][/u] 3 | [g]green[/g] | down 4 | [r]red[/r] | up 5 | [r]red[/r] | up 6 | [g]green[/g] | up 7 | [e]blue[/e] | down 8 | [g]green[/g] | down 9 | [g]green[/g] | up [/table] [table] 0 | [r]red[/r] | down 10 | [e]green[/e] | down 20 | [g]blue[/g] | down 30 | [e]blue[/e] | up [i][u]40[/i][/u] | [i][u][g]green[/g][/i][/u] | [i][u]up[/i][/u] 50 | [g]green[/g] | down 60 | [r]red[/r] | up 70 | [e]blue[/e] | up 80 | [r]red[/r] | down 90 | [r]red[/r] | up [/table] [table] 0 | [e]blue[/e] | down 100 | [e]blue[/e] | up 200 | [g]green[/g] | down [i][u]300[/i][/u] | [i][u][e]blue[/e][/i][/u] | [i][u]down[/i][/u] 400 | [r]red[/r] | down 500 | [e]blue[/e] | down 600 | [g]green[/g] | up 700 | [g]green[/g] | down 800 | [e]blue[/e] | up 900 | [e]blue[/e] | up [/table]