Рет қаралды 9,472
This video was sponsored by Brilliant.
Keep exploring at brilliant.org/DigiDigger. Get started for free, and hurry-the first 200 people get 20% off an annual premium subscription.
How does the Artificial Intelligence (AI) work in video games? In part 1 of this video we will show how you can make an AI that can beat you at tic-tac-toe or chess and how NPCs can find their way to their destination in a digital world.
I will explain MiniMax trees and pathfinding algorithms such as Breadth-First Search, Dijkstra's Algorithm and A*.
It seems my source was incorrect about the complexity of the Pacman Algorithm. Based on an interview with Toru Iwatani, there is indeed more to it: programmersatwork.wordpress.c...
To learn more check out this wonderful explanation: • Pac-Man Ghost AI Expla...
Timestamps
0:00 Intro
3:00 How do MiniMax trees work?
7:05 How does Breadth First Search work?
8:24 How does Dijkstra's Algorithm work?
10:15 How does A* work?
12:05 Conclusion
My patreon: / digidigger
Music in in outro:
Besus y Abrazor - Rolemusic: freemusicarchive.org/music/Ro... available under a Creative Commons Attribution license creativecommons.org/licenses/...
References
alumni.media.mit.edu/%7Ejorkin...
www.gdcvault.com/play/1020775...
www.cs.mun.ca/%7Edchurchill/pd...
/ artificial_intelligenc...
/ advice_on_building_a_c...
/ building_a_game_ai_for...
dzone.com/articles/from-dijks...
dzone.com/articles/from-dijks...
qiao.github.io/PathFinding.js...
www.bewitched.com/chess/
• The F.E.A.R. AI