When building multiway postflop trees, the solution won’t compute if the tree is too large. This means having to tinker and tinker with the solution and retry each time until you get something small enough that’s still usable. It would help if there was some kind of checkmark/X or yes/no indicator that let us know if the tree is computable before we attempt to create it, so that we don’t have to brute force trial-and-error just to see a solution, and so we can better gauge how much detail and complexity the tree can have.