What is meant by heuristic & how it is used to solve a problem? For example: I have read that, programmers often solve a shortest path problem by heuristic rather than using a algorithm like Djikstra's algorithm. My question is, why?? If the ans is heuristic is faster than algorithm (like Djikstra's algorithm) , then I need to know more details about it.Thanks.

asked 05 Jan '15, 15:01

ornab_ahmed's gravatar image

ornab_ahmed
314

আমার মনে হয় প্রশ্ন এবং উত্তর বাংলায় লিখলেই ভালো হয়, ইংরেজীতে তো হাজার হাজার ওয়েবসাইট আছে। আমরা তো সাইটটা তৈরীই করলাম বাংলায় রিসোর্স কনটেন্ট এর পরিমান বাড়ানোর জন্য।

(05 Jan '15, 20:03) tahmidrafi ♦♦

Algorithm is a well-defined set of instructions for doing a particular task. Algorithm explores all the possibilities of a problem and solves it in a well defined way. Heuristic is also kind of algorithm but one that will not explore all possible states of the problem, or will begin by exploring the most likely ones.

Suppose a chess game: 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. A heuristic would exclude full branches that begin with obviously bad moves.

permanent link

answered 05 Jan '15, 16:12

__salman__'s gravatar image

__salman__ ♦♦
1.1k211

Your answer
toggle preview

Follow this question

By Email:

Once you sign in you will be able to subscribe for any updates here

By RSS:

Answers

Answers and Comments

Markdown Basics

  • *italic* or _italic_
  • **bold** or __bold__
  • link:[text](http://url.com/ "title")
  • image?![alt text](/path/img.jpg "title")
  • numbered list: 1. Foo 2. Bar
  • to add a line break simply add two spaces to where you would like the new line to be.
  • basic HTML tags are also supported

Question tags:

×214
×37
×1

question asked: 05 Jan '15, 15:01

question was seen: 1,547 times

last updated: 05 Jan '15, 20:03