What is the Minimax method?

Asked

Viewed 152 times

1

The Wikipedia defines Minimax as:

In decision theory, Minimax (or minmax) is a method for minimizing the maximum possible loss. It can be considered as the maximization of the minimum gain (Maximin).(...)

There also exemplifies with an algorithm:

ROTINA minimax(nó, profundidade)
    SE nó é um nó terminal OU profundidade = 0 ENTÃO
        RETORNE o valor da heurística do nó
    SENÃO SE o nó representa a jogada de algum adversário ENTÃO
        α ← +∞
        PARA CADA filho DE nó
            α ← min(α, minimax(filho, profundidade-1))
        FIM PARA
        RETORNE α
    SENÃO
        α ← -∞
        PARA CADA filho DE nó
            α ← max(α, minimax(filho, profundidade-1))
        FIM PARA
        RETORNE α
    FIM SE
FIM ROTINA

Someone could better explain what this Minimax method is and an application of it in a real situation?

algorithm
  • 1

    @Luizvieira my question is not directly linked to AI, but I read one in the other to see if the answer answers.

  • I know it’s not, but in fact the title there is restricting the content because it also applies to your doubt the way it’s here. Take a look, and if your question is more specific, edit the question to add the details (which I then withdraw the vote to close as duplicate). :)

  • 1

    @Luizvieira unfortunately where I am can not see the images, but the text responds to really met, thanks for accurate indication. :)

No answers

Browser other questions tagged algorithm

You are not signed in. Login or sign up in order to post.