AngouriMath
DeepestDescent
Field
Summary
How deep the recursive descent may go before it declines to go further.
Remarks
exception a caller can handle: it takes the process down, so anything the process had
not finished is lost. Found by
suites, where the run died with
of frames alternating ComputeIndefiniteIntegral(AngouriMath.Entity,AngouriMath.Entity.Variable,System.Boolean) with
SolveBySubstitution(AngouriMath.Entity,AngouriMath.Entity.Variable,System.Boolean).
https://github.com/asc-community/AngouriMath/issues/1232
variable. The key
even when the level is the same problem renamed, and answered can never
fire on a cycle. Neither could a set of shapes already visited, for the same reason —
the shapes are alpha-equivalent rather than equal. A depth bound does not care what
the levels are called.
twenty-three integrands chosen from the hard end of the corpus — the ones that take
substitutions, by-parts chains and partial fractions — the deepest any *answered*
integral reaches is 13, for
about two and a half times the deepest real descent seen.
descent branches: the remark on answered above records a single call
entering the integrator 5,330 times for 23 distinct integrands. Depth that is never
legitimately used is still searched before it is abandoned, so a bound of 64 stopped
the crash and left the run crawling. A bound has to be tight enough to be a bound.
process says nothing at all.
Angouri © 2019-2023 · Project's repo · Site's repo · Octicons · Transparency · 4378 pages online