• Save
Ai searching
Upcoming SlideShare
Loading in...5
×

Like this? Share it with your network

Share
  • Full Name Full Name Comment goes here.
    Are you sure you want to
    Your message goes here
    Be the first to comment
    Be the first to like this
No Downloads

Views

Total Views
865
On Slideshare
865
From Embeds
0
Number of Embeds
0

Actions

Shares
Downloads
0
Comments
0
Likes
0

Embeds 0

No embeds

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
    No notes for slide

Transcript

  • 1. 1
    Presentation
    Topic On
    INTRODUCTION TO SEARCH
    Submitted To
    Miss Shivani Aggrawal
    Submitted By
    Ashish Kr. Singh
    0819314012
    MCA 3nd Year
    United College of Engineering & Research Gr.Noida
    Knowledge Park – III Gr.Noida
  • 2. 2
    SearchingTechniques
    Many problems in AI can be solved in theory by intelligently searching through many possible solutions. Reasoning can be reduced to performing a search. For example, logical proof can be viewed as searching for a path that leads from premises to conclusions, where each step is the application of an inference rule. Planning algorithms search through trees of goals and sub goals, attempting to find a path to a target goal, a process called means-end analysis.
    Basically we can divide searching techniques into many categories depending on their behavior.
    1-Linear Search & Binary Search
    2-Uniform Search & inform Search
  • 3. 3
    Examples
    Logistics
    Robot Navigator
    8-queens problem
    Logic puzzles
    Hill Climbing
    Search methods
    1-Uninformed search
    2-Informed search
    3-Local search
    4-Game trees
  • 4. 4
    8-Puzzle
    Given an initial configuration of 8 numbered tiles on a 3 x 3 board, move the tiles into a desired goal configuration of the tiles.
    Goal state
    Start state
  • 5. 5
    2
    8
    3
    1
    6
    4
    7
    5
    2
    8
    3
    1
    4
    7
    6
    5
    2
    3
    1
    8
    4
    7
    6
    5
    3
    1
    8
    4
    7
    6
    5
    1
    3
    8
    4
    7
    6
    5
    1
    3
    8
    4
    7
    6
    5
    2
    2
    2
    start
    goal
  • 6. 6
    Robot navigation
  • 7. 7
    Robot Navigation
  • 8. 8
    Robot Navigation
    5
    8
    7
    4
    6
    2
    3
    3
    5
    4
    6
    3
    7
    4
    5
    5
    0
    2
    1
    1
    6
    3
    2
    4
    7
    6
    5
    7
    8
    3
    6
    5
    2
    4
    4
    3
    5
    6
  • 9. 9
    Robot Navigation
    5
    8
    7
    4
    6
    2
    3
    3
    5
    4
    6
    3
    7
    4
    5
    5
    0
    0
    2
    1
    1
    6
    3
    2
    4
    What happened???
    7
    7
    6
    5
    7
    8
    3
    6
    5
    2
    4
    4
    3
    5
    6
  • 10. 10
    Robot Navigation
    3+8
    2+9
    5+6
    4+7
    3+8
    5
    8
    7
    4
    6
    2
    3
    3
    5
    4
    6
    7+2
    3
    7
    4
    5
    5
    6+1
    6+1
    8+3
    0
    2
    1
    1
    6
    3
    2
    4
    6+1
    7+0
    7+2
    7
    6
    5
    8+1
    7
    8
    3
    6
    5
    2
    4
    4
    3
    5
    6
    6+1
    7+2
    3+8
    2+9
    2+9
    3+10
    5+4
    4+5
    4+5
    3+6
    3+6
    2+7
    8+3
    7+4
    7+4
    6+5
    6+3
    5+6
    2+7
    3+8
    5+6
    4+7
    4+7
    3+8
    2+9
    1+10
    1+10
    0+11
    7+2
    6+3
    6+3
    5+4
    7+0
    8+1
  • 11. 11
    8 – Quin Problem
    Place eight queens on a chessboard such that no queen attacks any other.
    What are the states and operators?
    Distinct Solution-92
    Unique Solution-12
  • 12. 12
    THANKS
    Ashish Kr. Singh
    MCA 3nd Year
    0819314012