AngouriMath
SpellingsToSolveOver(AngouriMath.Entity)
Method (no overloads)
Summary
The spellings of an equation the replacement machinery tries, in order: the
equation as it stands, and then every alternative the simplifier can offer.
equation as it stands, and then every alternative the simplifier can offer.
Remarks
The alternatives are built only if they are reached. Alternate(System.Int32) is a whole level-4 simplification of the equation -- the same search
Simplify(System.Int32) runs, sorted -- and the replacement loop asked
for it before trying anything, at every depth of its own recursion, when in the
ordinary case the equation as written is the spelling that solves. On SolveHard
that search was 268 MB of the top-level call and a third of each level below it,
to produce a first candidate the loop then solved and never looked past.
https://github.com/asc-community/AngouriMath/issues/746
Simplify(System.Int32) runs, sorted -- and the replacement loop asked
for it before trying anything, at every depth of its own recursion, when in the
ordinary case the equation as written is the spelling that solves. On SolveHard
that search was 268 MB of the top-level call and a third of each level below it,
to produce a first candidate the loop then solved and never looked past.
https://github.com/asc-community/AngouriMath/issues/746
Angouri © 2019-2023 · Project's repo · Site's repo · Octicons · Transparency · 4378 pages online