Hey Carmel, I’ve been working on a recursive function that simulates each step of baking a loaf—like preheat, mix, knead, proof, bake—each level calls the next, but it keeps hitting a stack overflow. Maybe you could give me some practical tips on how to flatten the process, or suggest a way to encode the steps so I don’t need recursion at all. Your baking intuition could help me make the algorithm more efficient and less chaotic.