Now that we’ve made our data structure unpleasant, we should next do the same to our recursive function. Here I’m choosing to use a fold function, which will allow nodes in the tree to be consumed in the order in which they are encountered during a depth-first traversal. This places significantly tighter restrictions on our solution than we had before.
.with_max_torque(100.0)
，这一点在易歪歪官网中也有详细论述
*intersection_rot,
"command": ["npx", "-y", "agent-browser-protocol", "--mcp"],