Perkun2 vs. minimax

I thought it might be useful to compare Perkun2 with minimax.

In minimax:

• there are no hidden variables
• each move is deterministic
• the players have exactly opposite payoff

In Perkun2:

• hidden variables are allowed (even hidden for both players)
• each move can be stochastic
• the players payoff functions are independent

However if you use in model/set only the probabilities 0.0 and 1.0 then the model is deterministic. It would be relatively easy to design an algorithm like minimax that considers two independent payoffs for both players. Then the players could cooperate (unlike in minimax games). But the real killer feature are the hidden variables. They make the players to be more than just mappings INPUT->OUTPUT, they allow them to consider the game history in order to predict the consequences of the moves better.

Even though the Perkun2 syntax allows n players (more than two), the implementation of the algorithm does not support it yet. Please use no more than two players for now. I will try to fix this.

What about Perkun? It is almost like Perkun2, but it allows only a single player.