课程: AI Algorithms for Game Design with Python

免费学习该课程！

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

Solution: A pruning cat

Solution: A pruning cat - Python教程

课程: AI Algorithms for Game Design with Python

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

Solution: A pruning cat

“

(funky upbeat music) - [Instructor] Let me show you my implementation of the alpha beta cat. As you can see in line 282, the alpha beta max value method is doing pretty much the same thing as the regular max value method, but it takes alpha and beta as additional parameters. So where are those values used? You can see them in line 303 in the recursion and also in line 312 where we check the value of beta to apply the pruning, and then in line 314 when we update alpha. As for the alpha beta min value method, we have the corresponding code in lines 355 through 357. Let's see if we can experience the improvement of the alpha beta pruning algorithm. So let me set up the same perfect world, but I will complicate it by adding one more available tile. This causes the tree to expand a lot. So let me set this up for playing with the regular Minimax algorithm and let me make a move. The perfect move would be to go up. And the cat got a timeout. Now let me do the same thing, but now I will use…

内容