Definition
In mathematical optimization and computer science, heuristic is a technique designed for problem solving more quickly when classic methods are too slow for finding an exact or approximate solution, or when classic methods fail to find any exact solution in a search space. This is achieved by trading optimality, completeness, accuracy, or precision for speed. In a way, it can be considered a shortcut.
Related concepts
A* searchAccuracy and precisionAdmissible heuristicAlgorithmAllen NewellAlpha–beta pruningAntivirus softwareBest-first searchComputational performanceComputer scienceConstructive heuristicDirected graphDistanceFunction (mathematics)Greedy algorithmGreek languageHerbert A. SimonHeuristic (disambiguation)Jon Bentley (computer scientist)Knapsack problemMachine learningMalwareMathematical optimizationMatheuristicsMetaheuristicNP-hardNP-hardnessOverfittingPen plotterPolymorphic codeProbabilityProblem solvingRule of thumbSearch algorithmSearch problemSpace complexityStatistical analysisTravelling salesman problemTuring AwardVertex (graph theory)
6 concepts already in your glossary