This Unbeatable Tic-Tac-Toe AI Is Rude! (MiniMax Algorithm)

Описание к видео This Unbeatable Tic-Tac-Toe AI Is Rude! (MiniMax Algorithm)

I've programmed a Tic-Tac-Toe AI that cannot lose!
It uses the MiniMax algorithm to decide which moves to make.
In this video I show you exactly how it works and we use it to learn about good Tic-Tac-Toe strategy!

Chapters:
00:00 - Tic-Tac-Toe AI!
00:56 - Video plan
01:11 - How the AI works
01:49 - Example (MiniMax Algorithm)
04:07 - Choosing between equal moves
04:31 - The full game tree
05:16 - Understanding MiniMax
06:17 - Can you trick the AI?
07:12 - Why the AI cannot lose
07:36 - No sportsmanship
08:32 - A flaw!
09:30 - How to beat your friends
10:31 - Best opening move?
11:39 - Center move
12:13 - Edge move (between two corners)
12:57 - Corner move
13:35 - Thank you!

Комментарии

Информация по комментариям в разработке