The minimax algorithm is one of the simplest forms of AI game playing.

End-game states are evaluated with a "utility" function. Values of other game positions are found by modelling the differing goals of opposing players: one player tries to maximise values, and the other tries to minimise them.

00:00 Introduction
00:10 Step1: represent the problem
00:21 Single agent search
00:35 The difference when there are opposing players
01:06 The game of Nim as an example
01:22 Step 2: Processing the search space of a 7-match NIM game
02:17 The game-theoretic value
02:34 Summary & algorithm definition

This video updates one of the earliest videos posted on this channel.
Thanks for watching!

Additional explainer animation of Nim rules:
[ Ссылка ]

Soundtrack1: Mister Pink
Song by Anthony Vega
under license from artlist.io
[ Ссылка ]

Soundtrack2: Breaking Point
Song by Ian Post
under license from artlist.io
[ Ссылка ]

Chess animation by
Sophía Ponce on Lottiefiles.com
[ Ссылка ]
Lottie Simple License (FL 9.13.21)

Some background scenes from stortylocks.org, incidental graphics from Canva.

► Support the chanel
Like: Give a 👍 to this video (thanks!)
Subscribe: [ Ссылка ]

свернуть