The previous chapter introduced the Nash equilibrium strategy, which was derived using an algorithm called CFR. Before discussing CFR, let's first introduce regret matching.
Taking rock-paper-scissors as an example, its payoff matrix is as follows.
​
The algorithm iterates as follows:
For each player, initialize regretSum[action] to 0.
Iterate T times:
****Normalize any positive regretSum values to...