Solver

A solver is a piece of mathematical software, possibly in the form of a stand-alone computer program or as a software library, that 'solves' a mathematical problem.

Uses your system voice; voice and rate in settings.

≈ 5 min read

Cite, export and learn8 citation formats · 8 exports · lesson and quiz

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

A solver is a piece of mathematical software, possibly in the form of a stand-alone computer program or as a software library, that 'solves' a mathematical problem. A solver takes problem descriptions in some sort of generic form and calculates their solution. In a solver, the emphasis is on creating a program or library that can easily be applied to other problems of similar type.

  • 3 References
  • Solver types

    edit edit source

    Types of problems with existing dedicated solvers include:

    The General Problem Solver (GPS) is a particular computer program created in 1957 by Herbert Simon, J. C. Shaw, and Allen Newell intended to work as a universal problem solver, that theoretically can be used to solve every possible problem that can be formalized in a symbolic system, given the right input configuration. It was the first computer program that separated its knowledge of problems (in the form of domain rules) from its strategy of how to solve problems (as a general search engine).

    General solvers typically use an architecture similar to the GPS to decouple a problem's definition from the strategy used to solve it. The advantage in this decoupling is that the solver does not depend on the details of any particular problem instance. The strategy utilized by general solvers was based on a general algorithm (generally based on backtracking) with the only goal of completeness. This induces an exponential computational time that dramatically limits their usability. Modern solvers use a more specialized approach that takes advantage of the structure of the problems so that the solver spends as little time as possible backtracking.

    For problems of a particular class (e.g., systems of non-linear equations) multiple algorithms are usually available. Some solvers implement multiple algorithms.

    See also

    edit edit source

    Lists of solvers

    edit edit source

    References

    edit edit source
    1. ^ Using QBF Solvers to Solve Games and Puzzles - Boston College Wikipedia revision 1366459313, retrieved 2026-11-22
    2. ^ Zhang, Weixiong (2012-12-06). State-Space Search: Algorithms, Complexity, Extensions, and Applications. Springer Science & Business Media. ISBN 978-1-4612-1538-7. Wikipedia revision 1366459313, retrieved 2026-11-22
    3. ^ Bowling, Michael, and Manuela Veloso. An analysis of stochastic game theory for multiagent reinforcement learning. No. CMU-CS-00-165. Carnegie-Mellon Univ Pittsburgh Pa School of Computer Science, 2000. Wikipedia revision 1366459313, retrieved 2026-11-22
    4. ^ "A neural net solves the three-body problem 100 million times faster". MIT Technology Review. October 26, 2019. Retrieved 2021-05-16. Wikipedia revision 1366459313, retrieved 2026-11-22
    Industrial and applied mathematicsComputational Discrete Analysis Probability theory Mathematical
    physics
    Decision sciences Other applications Related Organizations Mathematical optimization softwareData formats Modeling tools Solvers

    Text derived from https://en.wikipedia.org/w/index.php?oldid=1366459313 under CC BY-SA 4.0; modifications have been made.

    Words in each sectionSolver typesSolver typesSolver types: 320 words320See alsoSee alsoSee also: 75 words75
    Words in each section. Measured from the stored article body; sections below the minimum are not plotted.

    Provenance

    snapshot enwiki-001366459313 · captured 2026-07-28 · ledger · version history

    Cite this page as: encyclopegia.org, “Solver”, snapshot enwiki-001366459313. https://encyclopegia.org/a/solver