In some cases you're not searching for the best solution, but for any solution fitting some constraint. A heuristic would exclude full branches that begin with obviously bad moves. When writing a chess game program you could imagine trying every possible move at some depth level and applying some evaluation function to the board. In such cases you often can get a not too bad solution much faster, by applying some arbitrary choices (educated guesses): that's a heuristic.Ī heuristic is still a kind of an algorithm, but one that will not explore all possible states of the problem, or will begin by exploring the most likely ones. Now, some problems are hard and you may not be able to get an acceptable solution in an acceptable time. You implement the algorithm using some programming language to get (a part of) a program. The solution could or could not be the best possible one but you know from the start what kind of result you will get. What the algorithm does is precisely defined. An algorithm is the description of an automated solution to a problem.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |