Algorithms Explained – minimax and alpha-beta pruning

I love and appreciate this video thank you

I can hear ever morsel of liquid in your mouth. Good content, change your mic lol

I study computer science at the TU in Berlin Germany and had really big problems with this algorithm!

So ty a lot! You probably safed a few points for me!

wow this is an amazing explanation and really made be feel excited when I finally understood

So good ❤

our professor didn't told us it the Childs would be sorted and I was confused as hell. thanks man.

why not settling for +1 or -1 and go for deeper search instead of pruning with - and + infinity? my bot plays like humans more like Alireza. if he finds a win he will prune everything. +1 or -1 based on the color is enough to give the bot personality. who cares about mate in 3

very helpful, saved me from 5 hours of lectures 🔥

amazing video!

Thanks a lot for this, super simple explanation!

Now calculate EVERY possible move in chess

Guys where are these numbers coming from😭

should have takedn the knight with queen

This video is masterpiece! Thank you so much ~~

tysm

This man wrapped up this concept in 11 mins whereas my university professor and his TA failed to do so miserably for over 2 weeks.
Our education system sucks. We need more qualified people in our institutes.
Thank you for your efforts @Sebastian Lague.

the best explanation bro, thanks from Bolivia

visual explanation with the code <3 thanks

In engines, doing this recursively will cause a lot of overhead

so clear,this is what call good education video,deep explain,yet damn easy grasp

Brother you are a life saver ❤

fantastic

My AI professor must watch this and learn how to teach.

i have a question what exactly does alpha and beta mean/represent?

Thank you so much, fantastic resource

For me, this video has pruned hours of searching for how this algorithm works. Thank you so much for this nice and clear explanation!

depth <= 0

I love you so much, you don't have any idea this video how much helps me. Thank you so much again ❤️

thank you

Wow!!!

Thank you so much for this. Many people explain minimax codes and alpha beta pruning, but none that I have seen actually gave some sort of coding example. Thank you for this. its amazing.

You scratch the insides of my brain. Thank you.

amazinggg!!! You explained better than my teacher at school

Thank you for this video, it's been really helpful

du, det er jo bare ta litt vekk fra treet.

This is a nice and intuitive explination. Thanks!

You're mic is so good that makes me hear your tongue voices, I hate it. Therefore I will leave a dislike.

For some ungodly reason, alpha-beta keeps reappearing in my university courses. This is the third year in a row that I'm referencing this video -- and it delivers every time.

I really enjoy the way you combine the code with the visualisation, it is so impressive!

Thanks man, your explanation helped me a lot.

I now understand why my tic tac toe game chose an extra move, my algorithm wasn't pruning.

This is one of the best explanations I've come across. I'm currently programming a Ruby chess game and this is invaluable. Thank you so much!

I finally got a simple tic tac toe minimax working after weeks 😭 this video was a huge help

you're a god man, thank you

Incredible...I listened to an hour long lecture without understanding it and all I needed was a 11min video.

Amazing content! Thank you :D

Can Alpha beta pruning have another path to the optimal state?

I had a hard time understanding: You say White is the Maximizing Player....but is White the player that goes first? I'm thinking that is important.
I tried to implement this and I'm having issues...maybe it's my score or how I'm checking for a win