课程: AI Algorithms for Game Design with Python
免费学习该课程!
今天就开通帐号,24,700 门业界名师课程任您挑!
Challenge: A pruning cat
(upbeat music) - [Narrator] Ready for your next challenge? This time, your task is to finish the alpha-beta pruning algorithm. Similar to the first challenge, you are only required to fill in the blanks, but this time in the alpha-beta max value, and alpha-beta min value methods, just follow the instructions in the code. Also, like minimax, you will need to test this in a small world. So I still recommend that you use something like this, with no more than eight unblocked tiles. This exercise should take about 20 minutes to complete. Once you're done, check out my solution in the next video.
内容
-
-
-
-
Minimax overview4 分钟 1 秒
-
(已锁定)
Minimax example5 分钟
-
(已锁定)
The minimax algorithm3 分钟 41 秒
-
(已锁定)
A word on complexity2 分钟 45 秒
-
(已锁定)
Challenge: A perfect cat in a small world4 分钟 49 秒
-
(已锁定)
Solution: A perfect cat in a small world8 分钟 24 秒
-
Alpha-beta pruning5 分钟 32 秒
-
(已锁定)
The alpha-beta search algorithm5 分钟 9 秒
-
(已锁定)
Challenge: A pruning cat49 秒
-
(已锁定)
Solution: A pruning cat2 分钟 19 秒
-
-
-
-
-