[gck1]

I do this too, but the issue I have with this approach is that it's a never ending cycle. Codex/GPT will always find holes and claude will always agree they are holes. If you teach it YAGNI, then it will always disagree even on genuine holes.

If your original plan was to add a column in your db, after several cycles, your plan will be 10,000 lines long and it will contain a recipe on how to build a universe.

[ghm2199]

The "trick(s) here are to limit the scope by always reading the plan very carefully. Here is how I do it to tackle this problem:

1. You should recognize when said holes are not "needed" holes e.g. you could make do with in memory task scheduler without rolling out more complex ones.

2. You can break up the plan— longer plans have more holes and are unwieldy mentally to go 20 rounds with in a chat coding UI.

3. Give it Learning Tests: i.e. code to run against black boxes. It's just like how we write a unit test to understand how a system works