0
Want this question answered?
Be notified when an answer is posted
Add your answer:
Earn +20 pts
How do you get principal varivation from iterative deepening search?
You will get principal variation from iterative deepening search using sequential moves within the framework. It is important to note that this may slow down the search due to space requirements.Ê
Where is iterative deepening search worse than depth-first?
Iterative deepening will preform much worse than depth first when the desired nodes show up early in pre-order traversal of the graph. This means that on most diagrams the desired nodes would be in the bottom left. Depth first will find these almost immediately however iterative deepening will be forced to expand all nodes above the desired level first, significantly slowing down the find time.
What is the advantage of iterative deepening search over depth-first?
Iterative deepening effectively performs a breadth-first search in a way that requires much less memory than breadth-first search does. So before explaining the advantage of iterative deepening over depth-first, its important to understand the difference between breadth-first and depth-first search. Depth first explores down the tree first while breadth-first explores all nodes on the first level, then the second level, then the third level, and so on. Breadth-first search is ideal in situations where the answer is near the top of the tree and Depth-first search works well when the goal node is near the bottom of the tree. Depth-first search has much lower memory requirements. Iterative deepening works by running depth-first search repeatedly with a growing constraint on how deep to explore the tree. This gives you you a search that is effectively breadth-first with the low memory requirements of depth-first search. Different applications call for different types of search, so there's not one that is always better than any other.
Can you suggest an interesting algorithm in AI and an improvement of it?
Offcourse.Its MINIMAX Algorithm to construct game tree.The improvement is made by inventing Alpha-Beta Pruning.Another improvement over it is to apply Iterative Deepening Search(IDS) over it.
What are informed search techniques and uninformed search techniques?
•Uninformed search strategies-Also known as "blind search," uninformed search strategies use no information about the likely "direction" of the goal node(s)-Uninformed search methods: Breadth-first, depth-first, depth-limited, uniform-cost, depth-first iterative deepening, bidirectional•Informed search strategies-Also known as "heuristic search," informed search strategies use information about the domain to (try to) (usually) head in the general direction of the goal node(s)-Informed search methods: Hill climbing, best-first, greedy search, beam search, A, A*
Can iterative learning control be regarded as intelligent control?
Hallo, since a search for iterative learning leads to many articles at IEEE xplore that have a INSPEC controlled index "intelligent control" you can regard to it as intelligent control.
Is XP an upgraded form of Waterfall and Iterative models?
Hello: It depends on what you would like to call as an upgraded version. XP and the super set - Agile is much more than just iterative and incremental. You can check out this article found out by a Google search for more: http://www.agilecollab.com/iterative-and-incremental-is-not-equal-to-agile-key-aspects-of-agile Thanks
What are the ratings and certificates for The Deepening - 2006?
The Deepening - 2006 is rated/received certificates of: USA:R
What is the limitation and advantages of iterative model of sdlc?
In iterative model we get an end product at the end of each iteration. Iterative model is not so efficient and time consuming.
Does host computers typicall use iterative queries?
do host computers typicall use iterative queries
What are the release dates for The Deepening - 2006?
The Deepening - 2006 was released on: USA: 1 October 2006 (limited)
When you choose iterative or recursive algorithm?
If you cannot find any iterative algorithm for the problem, you have to settle for a recursive one.
