X se visit kr k agr hum ne pehle A ko select Kiya to pehle A wali side ko visit krne k baad Fr B pr ja k wahan se start karein ge visit to tb hi J pr pohanch sakte he na ye backtracking kese ki ap ne or fr result to XBJ aye ga ???
The great advantage of IDDFS is found in game tree searching where the IDDFS search operation tries to improve the depth definition, heuristics, and scores of searching nodes so as to enable efficiency in the search algorithm. Another major advantage of the IDDFS algorithm is its quick responsiveness.
Both are different in limited you have already depth limit means if you are given depth 2, it's means you only go to level 2 either you reached at goal state or not, you just stop at level 2. In interactive you increase the level as you visiting means if you are given depth 2 also write that it's interactive then you increase the level when you reached at level 2.
nice ink of pen
Thanks
X se visit kr k agr hum ne pehle A ko select Kiya to pehle A wali side ko visit krne k baad Fr B pr ja k wahan se start karein ge visit to tb hi J pr pohanch sakte he na ye backtracking kese ki ap ne or fr result to XBJ aye ga ???
Sir ham isme directly x se B and then i ,j nhi kr skte kya because ase goal jaldi mil jayega
100 batt ki ake batt
It's your choice that you either go to A or B if you go to B first then it will be the shortest path to go at goal state which is J.
happy belated teachers day sir
4:40
Sir ap konsa pen use kerte ho..🖊️
Ink pen
uniball pen
Sir ne jitna pen ka use kiya utne mai toh mera pura engineering khatam ho jayega😂😂
Sir aapne direct d se b ko chalaaya
U have to backtrack it from root node again cause there is no attachment from d to i
bro backtrack ke baad bhi to b pe hi aayenge
Video Credit :Education 4u
This content is from "Russell and Norvig"- Artificial Intelligence A Mordern Approach.
X to B chalay or phr B to J goal node tak aa jay gy
Sir ji notes bhi upload kr dijiye
Iterative Deepening and Depth Limited Search algorithm are same??? Kindly answer me???
No
The great advantage of IDDFS is found in game tree searching where the IDDFS search operation tries to improve the depth definition, heuristics, and scores of searching nodes so as to enable efficiency in the search algorithm. Another major advantage of the IDDFS algorithm is its quick responsiveness.
Both are different in limited you have already depth limit means if you are given depth 2, it's means you only go to level 2 either you reached at goal state or not, you just stop at level 2.
In interactive you increase the level as you visiting means if you are given depth 2 also write that it's interactive then you increase the level when you reached at level 2.
Sir notes dijiye naa
However is this algorithm related to artificial intelligence
uninformal example
to is me or DFS me kia farq hoa ????