Notesale: Turn your study into money

Document Preview

Extracts from the notes are below, to see the PDF you'll receive please use the links above

---

Artificial Intelligence Notes:

What is State Space Search | Introduction to Problem
Solving in Artificial Intelligence
State space searching It is one of the major application of artificial intelligence
...
In 8 puzzle problem that we have a board of 3 * 3, we have 9
spaces and 9 places In which we have 8 tiles which are numbered
...
I know that this
is my start state Now I want goal state Where I want to reach Otherwise you will keep
on searching
...
If we keep the space on left
side Then this will be formed over here like this If I do it on left then 5 will come here
...
In uninfor med
search we use concept of heuristic due to which we try to solve the problem quickly
In which we go towards benefit towards local benefit So that my problem can get
solved quickly Because uninformed takes exponential time Because in uninformed
B^d Time complexity is O ( b^d )

Uninformed Vs Informed Search in Artificial Intelligence
with Example
Difference between uninformed and informed searching
...
To solve
non polynomial problem, we use heuristic method
...
In 24 puzzle problem you might have to
go up to 10^24 states which is practically impossible A very big value
...
In informed A *
algorithm is very important Heuristic DFS is there Or heuristic BFS can also be
there Best first search method is there
...
you will come to
know about all the important points and keyword about DFS
...
DFS sequence is one of the
possible DFS sequences you can follow in anyway
...

BFS will always give optimal result only If all the cost are similar We are talking just
about that If cost of each node is different Of each edges Then we do not use BFS
We use the heuristic method Like A * But if we talk about DFS Then it is not necessary
that DFS will give us an optimal solution It is possible that the solution which it is
giving me is not optimal
...
In 4 searches only it can make us reach to the goal state It is only
when the cost of each edge we consider it as similar
...

We are searching from both the directions
...
Time complexity over here as compared to BFS and DFS reduces
...
Space complexity is O (
b^d ) Where b is a branching factor Branching factor means how many nodes are
there ahead And d means depth Till how much depth you are going And if we talk
about space complexity also Then obviously how many number of nodes are being
generated That much only space complexity will be there Depth first search generally
works on one side If I travels from here I will go to this then I went on this Then I
went
...
in this direction
...
But
this gives guaranteed solution over here So this is all about bidirectional search
technique
...
In last video we discussed That how do we solve
a 8 puzzle problem without heuristic
...
3 states will be formed in informed search or in
heuristic method Or you can say that best first method also works in this
way only
...
The minimum value of this state is minimum that
is the heuristic value is 2 That means it will take you to the goal state quickly
This is the basic concept of heuristic That we are trying to find out quick
answer So now you have to next explore only this
...

7 is okay 8 is also not there so 3 How much is its h value ? So that means
what is it 's heuristic value ? 3 We have to find the misplaced tile So look
which is the minimum from all of them From this minimum is H=1 So now
we do n't have to explore any of them You will only explore this In blind
search in this all the depth
...
achieved your goal state
over here You have to keep all these points in your mind
...


Best First Search Algorithm in Artificial Intelligence |
How it Works | All Imp Points(Pros & Cons)
We use heuristic method in this How to find the heuristic ? What is heuristic? I have
already made a video on this Even there is already video on informed and
uninformed search technique Their link is given in the description box
...
Euclidian distance is already given
over here So we have to consider it as heuristic value
...
The concept is very
simple What is the meaning of heuristic somewhere you will calculate distance
...
focus on
heuristic
...
In which
we take goal straight in our mind
...
As
we discusssed in dfs (defth for search ) and bfs (bfs ( breath for search) We
simply do treeverse We do towards breath or towards depth without
knowing anything
...
This is actual cost
...
That is
estimate
...
That 's why star in A * here we say it generally it means
admissible
...
So it comes here 16
...
value of C is
given 11
...
to C
...
SC because we have alreay finded out the value of SC f (N ) is already
finded
...
Therefore i
The cost of going from S to D is 3+7=10 I want to go from D to E
...
SCD means these three comes S C D
...
SC
is three plus C to D seven plus three ten plus two twelve
...
7 plus 3 ten plus 2 twelve
...
If SCF Means SBF so what will be the cost ? Nine
from F where i will go I will go to G
...
Nine plus 16 comes twenty five
...
If you find out any in this then this value will take you
to optimal value

---