informed Search and Uninformed Search

-

In this blog, you will learn all about the uniform-search and inform-search.
Uninformed Search Methods
An uninformed search is a searching technique that has no additional information about the distance from the current state to the goal.
  1. so it is also called blind search.
  2. Search without information.
  3. Use no knowledge.
  4. Time-consuming
  5. More complexity.
Types are DFS, BFS and UCS.
▪ informed Search Methods
  1. Informed Search is another technique that has additional information about the estimate distance from the current state to the goal. Uses knowledge to find the steps to the solution. This information are also called Heuristic h(n).
  2.            
  3. Search with information.
  4. Use knowledge.
  5. Quick solution.
  6. less complexity.
  7. Types are A*, heuristic DFS, and CSP



▪ types of Uninformed Search Methods

1.Depth First Search

The algorithm starts at the root node (selecting some arbitrary node as the root node in the case of a graph) and explores as far as possible along each branch before backtracking.



 2.Breadth-First Search


 Definition

Breadth-first search is an algorithm for traversing or searching tree or graph data structures. It starts at the tree root and explores all of the neighbor nodes at the present depth prior to moving on to the nodes at the next depth level

3.Uniform-Cost Search

Definition
Uniform-cost search expands nodes according to their path costs form the root node. It can be used to solve any graph/tree where the optimal cost is in demand.
Disadvantage
It does not care about the number of steps.

Complexity=0(bc*/e)
c* is cost of optimal path.
e is a small positive constant. 

▪ types informed Search Methods

Constraint Satisfaction Problem
Consists of three-component V , D and C.
V is the set of a variable .
D is the set of the domain. One for each variable.
C is the set of Constrain.that specify allowable combination of value.

In artificial intelligence and operations research, constraint satisfaction is the process of finding a solution to a set of constraints that impose conditions that the variables must satisfy.


Example


2.A* Search algorithm


3.Greedy Search algorithm 




Comments

  1. AdminNovember 16, 2020 at 12:56 AM

    Hi! brother kindly contact me I want to ask something from you.
    I am waiting for your response

    ReplyDelete

Post a Comment

Popular posts from this blog

A publishing company that markets both book and audio-cassette in java. (Solution)

-
Image
Q   Imagine a publishing company that markets both book and audio-cassette versions of its works. Create a class publication that stores the title and price of a publication. From this class derive two classes:  a. Book, which adds a page count  b. Tape, which adds a playing time in minutes. Each of these three classes should have set() and get() functions and a display() function to display its data. Write a main() program to test the book and tape class by creating instances of them, asking the user to fill in their data and then displaying the data with display(). Solution code class Publication{ int price ; String title ; public Publication ( int price , String title) { this . price = price ; this . title = title ; } public int getPrice () { return price ; } public void setPrice ( int price) { this . price = price ; } public String getTitle () { return title ; } p...
Read more

Create a class named Movie that can be used with your video rental business in java

-
Image
Create a class named Movie that can be used with your video rental business. The Movie class should have ID Number, and movie title with appropriate getter and setter methods. Also create an equal() method that overrides Object ’s equals() method, where two movies are equal if their ID number is identical. Next, create three additional classes named Action, Comedy, and Drama that are derived from Movie. Finally, create an overridden method named calcLateFees that takes as input the number of days a movie is late and returns the late fee for that movie. The default late fee is $2/day. Action movies have a late fee of $3/day, comedies are $2.50/day, and dramas are $2/day. Test your classes from a main method. Solution code: import java.sql.SQLOutput ; class Movie { int id ; String title ; public Movie ( int id , String title) { this . id = id ; this . title = title ; } public int getId () { return id ; } public void setId ( int...
Read more