Heuristic

“In computer science, artificial intelligence, and mathematical optimization, a heuristic (from Greek εὑρίσκω “I find, discover”) is a technique designed for solving a problem more quickly when classic methods are too slow, or for finding an approximate solution when classic methods fail to find any exact solution. This is achieved by trading optimality, completeness, accuracy, or precision for speed.(…)
A heuristic function, also called simply a heuristic, is a function that ranks alternatives in search algorithms at each branching step based on available information to decide which branch to follow. For example, it may approximate the exact solution.”

From Heuristic (Computer Science) on Wikipedia

Leave a Reply

All fields are optional. Your email address will not be published.

This site uses Akismet to reduce spam. Learn how your comment data is processed.