课程: AI Algorithms for Game Design with Python
今天就开通帐号，24,700 门业界名师课程任您挑！
The negamax algorithm
- [Instructor] It's time to talk about further optimizations and improvements you can apply to your algorithms. Here's the first one. Let's take a minute to look at the original functions that implement the max nodes and min nodes in minimax. Notice how these two functions are almost the same thing, and their differences are all summarized by flipping the sign of the values and functions that change. For example, notice the opposite signs in the initial value of V in lines 3 and 10. Notice the opposite functions in lines 5 and 12. Whatever we maximize in a function, the other one minimizes. So if you are an experienced programmer, you might be thinking that there must be a way to summarize these two functions into a single function. Well, there is, it's called the negamax algorithm. As the name hints, it consists on alternating or negating the sign of a parameter between function calls. Thus negamax is short for negated minimax. This implementation is based on the nature of the games…
下载课程离线学习
下载课程到移动设备，轻松离线学习。在领英学习 iOS 或安卓版 APP 下载课程