Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

Solver

From Wikipedia, the free encyclopedia
(Redirected fromSolver (computer science))
Software for a class of mathematical problems
For the band, seeSolver (band).
icon
This articleneeds additional citations forverification. Please helpimprove this article byadding citations to reliable sources. Unsourced material may be challenged and removed.
Find sources: "Solver" – news ·newspapers ·books ·scholar ·JSTOR
(September 2009) (Learn how and when to remove this message)

Asolver is a piece ofmathematical software, possibly in the form of a stand-alonecomputer program or as asoftware 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.

Solver types

[edit]

Types of problems with existing dedicated solvers include:

TheGeneral Problem Solver (GPS) is a particular computer program created in 1957 byHerbert Simon,J. C. Shaw, andAllen 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 ofdomain rules) from its strategy of how to solve problems (as a general searchengine).

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 onbacktracking) with the only goal of completeness. This induces an exponentialcomputational 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 ofnon-linear equations) multiple algorithms are usually available. Some solvers implement multiple algorithms.

See also

[edit]

Lists of solvers

[edit]

References

[edit]
  1. ^Using QBF Solvers to Solve Games and Puzzles - Boston College
  2. ^Zhang, Weixiong (2012-12-06).State-Space Search: Algorithms, Complexity, Extensions, and Applications. Springer Science & Business Media.ISBN 978-1-4612-1538-7.
  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.
  4. ^"A neural net solves the three-body problem 100 million times faster".MIT Technology Review. October 26, 2019. Retrieved2021-05-16.
Computational
Mathematical
software
Discrete
Analysis
Probability theory
Mathematical
physics
Algebraic
structures
Decision sciences
Other applications
Related
Organizations
Retrieved from "https://en.wikipedia.org/w/index.php?title=Solver&oldid=1226805599"
Categories:
Hidden categories:

[8]ページ先頭

©2009-2026 Movatter.jp