From the course: AI Algorithms for Game Design with Python
Unlock this course with a free trial
Join today to access over 24,400 courses taught by industry experts.
Is iterative deepening a waste of time? - Python Tutorial
From the course: AI Algorithms for Game Design with Python
Is iterative deepening a waste of time?
- Is iterative deepening a waste of our time. Let me further explain this question. Suppose we have this deadline where the horizontal axis is time. Now, suppose that computing a tree of depth one takes this long, a tree of depth two takes this long, and so on for depths three, four, five, and six. Remember that we don't know this in advance, but notice that a tree of depth five could be very well computed in the allotted time. However, depth six would take longer, so it's not an option. Now, we might be concerned that applying iterative deepening for depths one, two, three, and four would force us to abort the recently started computation of the tree of depth five, thus returning the solution for depth four when we could have made a better use of our time on the solution for depth five from the beginning. So once again, the original question can be formulated like this. Are depths one through four interfering with the best possible solution in the allotted time? Are those…
Contents
-
-
-
-
-
-
(Locked)
The iterative deepening technique2m 56s
-
(Locked)
Is iterative deepening a waste of time?7m 41s
-
(Locked)
Challenge: An iteratively deepening cat38s
-
(Locked)
Solution: An iteratively deepening cat5m 27s
-
(Locked)
Is iterative deepening really that good?2m 37s
-
(Locked)
Is alpha-beta pruning really that good?4m 35s
-
(Locked)
-
-