Assignment No 4 Ai

ARTIFICIAL INTELLIGENCE
Fatima Jinnah Women University

Department of Computer Science
--------------------------------------------------------------------------------------
ASSIGNMENT # 04
Subject: Artificial Intelligence
Submitted to: Ma’am Andleeb Yousuf
Semester: BCSVI (B)
Submitted by: Shaffaq Siddique…….... (025)
Submission Date: 8th June, 2020
Question # 01:
1
1) What is the distinction between informed and uninformed search?

Answer:
Informed Search: Informed Search algorithms have information on the goal state which helps
in more efficient searching. This information is obtained by a function that estimates how close a
state is to the goal state.
Example:
 Greedy Search and Graph Search
Uninformed Search: Uninformed search algorithms have no additional information on the goal
node other than the one provided in the problem definition. The plans to reach the goal state from
the start state differ only by the order and length of actions.
Examples:
 Depth First Search and Breadth-First Search
Informed Search vs. Uninformed Search:
INFORMED SEARCH UNINFORMED SEARCH
It uses knowledge for the searching It doesn’t use knowledge for searching
process. process.
It finds solution slow as compared to informed

It finds solution more quickly.
search.
It is highly efficient. It is mandatory efficient.
Cost is low. Cost is high.
It consumes less time. It consumes moderate time.
It provides the direction regarding the No suggestion is given regarding the solution
solution. in it.
It is less lengthy while implementation. It is more lengthy while implementation.
Greedy Search, A* Search, Graph Search Depth First Search, Breadth First Search
2
2) What is a heuristic?
Answer:
A heuristic technique, or a heuristic, is any approach to problem solving or self-discovery that
employs a practical method that is not guaranteed to be optimal, perfect, or rational, but is
nevertheless sufficient for reaching an immediate, short-term goal.
Heuristics can be mental shortcuts that ease the cognitive load of making a
decision. Examples that employ heuristics include using trial and error, a rule of thumb or an
educated guess.
3) When is a heuristic admissible?
Answer:
In computer science, specifically in algorithms related to pathfinding, a heuristic function is said
to be admissible if it never overestimates the cost of reaching the goal, i.e. the cost it estimates to
reach the goal is not higher than the lowest possible cost from the current point in the path.
4) A* can be seen as a combination of what two search strategies?
Answer:
It can be viewed as a combination of lowest-cost-first and best-first. A* is based on using
heuristic methods to achieve optimality and completeness, and is a variant of the best-first
algorithm. When a search algorithm has the property of optimality, it means it is guaranteed to
find the best possible solution, in our case the shortest path to the finish state.
Question # 02:
Consider the search problem represented in Figure 1:
where a is the start node and e is the goal node. The pair [f, h] at each node
indicates the value of the f and h functions for the path ending at that node. Given
this information, what is the cost of each path?
1. The cost < a, c > = 2 is given as a hint.
2. Is the heuristic function h admissible? Explain why or why not.
3
Answer:
Part 1.
< a, b >= 1, < b, c >= 1, < a, c >= 2, < c, e >= 1, < c, f >= 1
Part 2.
Yes, it is admissible because it never overestimates the distance to the goal.
Question # 03:
Recall your knowledge of alpha beta pruning and apply to following search tree.
Identify all the unexplored nodes at the end.
Answer:
1)
4
2)
3)
5
4)
5)
6
6)
7)
7
8)
9)
8
10)
11)
9
12)
13)
10
CONCLUSION
11
It requires knowledge and experience to apply the heuristics effectively. It solves a problem
faster than classic methods, or to find an approximate solution when classic methods
cannot. Trained usability experts are sometimes hard to find and can be expensive. You should
use multiple experts and aggregate their results. The evaluation may identify more minor issues
and fewer major issues
REFERENCES
https://data-flair.training/blogs/heuristic-search-ai/
https://en.wikipedia.org/wiki/Heuristics_in_judgment_and_decision-making#:~:text=In%20their
%20initial%20research%2C%20Tversky,are%20called%20%22judgment%20heuristics%22.
12

Assignment No 4 Ai

Uploaded by

Copyright:

Available Formats

Assignment No 4 Ai

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Assignment No 4 Ai

Uploaded by

Copyright:

Available Formats

ARTIFICIAL INTELLIGENCE

Fatima Jinnah Women University

Subject: Artificial Intelligence

Submitted to: Ma’am Andleeb Yousuf

Semester: BCSVI (B)

Submitted by: Shaffaq Siddique…….... (025)

Submission Date: 8th June, 2020

1) What is the distinction between informed and uninformed search?

INFORMED SEARCH UNINFORMED SEARCH

It finds solution slow as compared to informed

It is highly efficient. It is mandatory efficient.

Cost is low. Cost is high.

It consumes less time. It consumes moderate time.

It is less lengthy while implementation. It is more lengthy while implementation.

You might also like