课程: AI Algorithms for Game Design with Python

免费学习该课程!

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

Challenge: A pruning cat

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.

内容