课程: AI Algorithms for Game Design with Python

免费学习该课程！

今天就开通帐号，24,700 门业界名师课程任您挑！

Is iterative deepening really that good?

Is iterative deepening really that good? - Python教程

课程: AI Algorithms for Game Design with Python

开始一个月试用 购买团队方案

Is iterative deepening really that good?

“

- [Narrator] Now I want you to see how well we are doing at our objective of making the best use of our time with iterative deepening. Let's take a look. We'll use a five-by-five hex grid without alpha-beta pruning, but I will use iterative deepening with a deadline of five seconds. So let me make a move. Let's look at the time report in the terminal. Our final move was found in a tree of depth six, and finding this move took about 4.2 seconds. The rest of the time was spent in depth seven, which was interrupted. But looking at the useful time of 4.2 seconds, notice how much of that time was spent in the previous depths. That's depth 1, 2, 3, 4, and 5. Those results were discarded and those results, all of them took 488 milliseconds. That's about 1/9 of the 4.2 seconds. In other words, it has taken about 11% of the whole useful time in analyzing trees with depths one through five, and the remaining 89% of that time was spent in calculating a useful solution. So yes, iterative…

内容