Successfully reported this slideshow.
We use your LinkedIn profile and activity data to personalize ads and to show you more relevant ads. You can change your ad preferences anytime.

Ai searching

1,000 views

Published on

Atificial Intelligence Searching

  • Be the first to comment

  • Be the first to like this

Ai searching

  1. 1. 1<br />Presentation<br />Topic On<br />INTRODUCTION TO SEARCH<br />Submitted To<br />Miss Shivani Aggrawal<br />Submitted By<br />Ashish Kr. Singh<br />0819314012<br />MCA 3nd Year<br />United College of Engineering & Research Gr.Noida<br />Knowledge Park – III Gr.Noida<br />
  2. 2. 2<br />SearchingTechniques<br /> 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. <br /> Basically we can divide searching techniques into many categories depending on their behavior.<br /> 1-Linear Search & Binary Search<br /> 2-Uniform Search & inform Search<br />
  3. 3. 3<br />Examples<br />Logistics<br />Robot Navigator<br />8-queens problem<br />Logic puzzles<br />Hill Climbing<br />Search methods<br />1-Uninformed search<br />2-Informed search<br />3-Local search<br />4-Game trees<br />
  4. 4. 4<br />8-Puzzle<br /> 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.<br /> Goal state <br /> Start state<br />
  5. 5. 5<br />2<br />8<br />3<br />1<br />6<br />4<br />7<br />5<br />2<br />8<br />3<br />1<br />4<br />7<br />6<br />5<br />2<br />3<br />1<br />8<br />4<br />7<br />6<br />5<br />3<br />1<br />8<br />4<br />7<br />6<br />5<br />1<br />3<br />8<br />4<br />7<br />6<br />5<br />1<br />3<br />8 <br />4<br />7<br />6<br />5<br />2<br />2<br />2<br />start<br />goal<br />
  6. 6. 6<br />Robot navigation<br />
  7. 7. 7<br />Robot Navigation<br />
  8. 8. 8<br />Robot Navigation<br />5<br />8<br />7<br />4<br />6<br />2<br />3<br />3<br />5<br />4<br />6<br />3<br />7<br />4<br />5<br />5<br />0<br />2<br />1<br />1<br />6<br />3<br />2<br />4<br />7<br />6<br />5<br />7<br />8<br />3<br />6<br />5<br />2<br />4<br />4<br />3<br />5<br />6<br />
  9. 9. 9<br />Robot Navigation<br />5<br />8<br />7<br />4<br />6<br />2<br />3<br />3<br />5<br />4<br />6<br />3<br />7<br />4<br />5<br />5<br />0<br />0<br />2<br />1<br />1<br />6<br />3<br />2<br />4<br />What happened???<br />7<br />7<br />6<br />5<br />7<br />8<br />3<br />6<br />5<br />2<br />4<br />4<br />3<br />5<br />6<br />
  10. 10. 10<br />Robot Navigation<br />3+8<br />2+9<br />5+6<br />4+7<br />3+8<br />5<br />8<br />7<br />4<br />6<br />2<br />3<br />3<br />5<br />4<br />6<br />7+2<br />3<br />7<br />4<br />5<br />5<br />6+1<br />6+1<br />8+3<br />0<br />2<br />1<br />1<br />6<br />3<br />2<br />4<br />6+1<br />7+0<br />7+2<br />7<br />6<br />5<br />8+1<br />7<br />8<br />3<br />6<br />5<br />2<br />4<br />4<br />3<br />5<br />6<br />6+1<br />7+2<br />3+8<br />2+9<br />2+9<br />3+10<br />5+4<br />4+5<br />4+5<br />3+6<br />3+6<br />2+7<br />8+3<br />7+4<br />7+4<br />6+5<br />6+3<br />5+6<br />2+7<br />3+8<br />5+6<br />4+7<br />4+7<br />3+8<br />2+9<br />1+10<br />1+10<br />0+11<br />7+2<br />6+3<br />6+3<br />5+4<br />7+0<br />8+1<br />
  11. 11. 11<br />8 – Quin Problem<br />Place eight queens on a chessboard such that no queen attacks any other.<br />What are the states and operators? <br />Distinct Solution-92<br />Unique Solution-12<br />
  12. 12. 12<br />THANKS<br />Ashish Kr. Singh<br />MCA 3nd Year<br />0819314012<br />

×