Toggle navigation
JUPYTER
FAQ
View as Code
View on GitHub
Execute on Binder
Download Notebook
root-11.github.io
content
Notebook
Exhaustive search
- explore all combinations. This eliminates any doubt.
Ken Thompson
Satisficing search
- explore convenient combinations until a solution is found that is good enough.
Herbert Simon
Approximation
- If it is too hard to find a precise solution on the original problem, make a simplified model of the problem and use its solution.
Heuristics
- "If you don't know how to solve a particular problem, use a method that solves similar problems and modify it."
George Polya
Greedy Strategy
- Identify the single biggest gain, keep it & repeat the search on the remainder of the problem.
Marginal search
- Use a method to construct an initial solution, then use another method to search for marginal improvements to the initial solution.
Ensemble search
- From a pool of candidate methods, try them all and pick the best solution.
Divide and conquer
- split the problem into smaller subproblems, divide each subproblem further until solveable, then combine the partial solutions.
Novelty search
- "don't try to solve the problem. Try instead to discover novel features and if they work, explore them further."
Kenneth Stanley