课程: AI Algorithms for Game Design with Python
免费学习该课程!
今天就开通帐号,24,700 门业界名师课程任您挑!
Is alpha-beta pruning really that good? - Python教程
课程: AI Algorithms for Game Design with Python
Is alpha-beta pruning really that good?
- [Instructor] Now I want to show you how good alpha beta pruning really is. I will show you these improvements for limited depth search as well as for iterative deepening. So let's start with a limited depth of five. I will make a move without alpha beta pruning. Then I will restore the state of the game to repeat the move with alpha beta pruning to compare the results. So let me block this style. It took this cat about 4.5 seconds to produce a move with a tree of depth five. Now let me restore the state of the game, and now I'll repeat the same move with alpha beta pruning. Let's see what happens. You may have noticed that it worked way faster. How faster? Well, without alpha beta pruning, it took 4.5 seconds, and with alpha beta pruning, it took about 250 milliseconds. That's one quarter of a second. Let's make another comparison for yet another move. Let me remove the alpha beta pruning, and now I will click on this style. There you have it. It took four seconds. Let me restore…
内容
-
-
-
-
-
-
(已锁定)
The iterative deepening technique2 分钟 56 秒
-
(已锁定)
Is iterative deepening a waste of time?7 分钟 41 秒
-
(已锁定)
Challenge: An iteratively deepening cat38 秒
-
(已锁定)
Solution: An iteratively deepening cat5 分钟 27 秒
-
(已锁定)
Is iterative deepening really that good?2 分钟 37 秒
-
(已锁定)
Is alpha-beta pruning really that good?4 分钟 35 秒
-
(已锁定)
-
-