Let's Learn Python #21 - Min Max Algorithm

This week, I cover the Min Max algorithm and a simple implementation of it in Python!

Please leave me a comment or question below! Like and Subscribe to show your support! :D

========================================
LINK-A-SAURUS!!

=========================================

Music by Juto: Link Coming Soon!

=========================================
--- SUPER TUTORIAL LIST!!! ---

PLAYLISTS

=========================================

[chickenzwings]

Something I love about these videos is right from the start of the series you always end the videos saying you KNOW we can do it and that we did a great job... In my second year of university now and I have yet to have a professor give such positive feedback, and I really think it helps motivate the student. At least it does for me. Thank you :) 

[simon_]

thank you for explaining the concept very well very briefly and the sample code provided the tiny things that I need but not familiar in Python
awesome vid!

[stMusic]

For interested ones, here is the code i got from the video. I've wrote down some notes for myself in comments.

[samiere]

Hi, at 3:10 how is this configuration possible? If one player has won the game, shouldn't there be no possible states that branch from it?

[nadavbi]

Great video !!!
i have a quetion :
if i will choose sum of 3 (2 and the 1 or 1 and then 2 ) in the first two steps i will win , or it happen just to me ?
example moves :
me :1
comp :2
me : 2
comp : 2
me : 1
comp : 2
me : 1

[mattkerin]

Great video Trevor. I'm slightly confused about your notation in the Node class though, why do you create an instance variable self.CreateChildren() for the method CreateChildren but not for the method RealVal?

[manhtuetruong]

When I tried to build the tree structure followed this code (but in Java). I got stack overflow error. I was wondering if this recursive call could be done in java?

[MK-yzpr]

Hello! Great code! I have one question. Is depth something like game difficulty? What I understand is that the more the depth is the computer will search further to calculate best move. Is my thinking correct?

[mutassem]

THANKS for great tutorials.   why not provide  480 video format? it's clearer than 360 and much smaller in size than 720

[jacobhansen]

Dude we can't se the code, which value do you pass the node constructor on line 82

[DestricaUK]

Could someone paste me the code I keep getting this:

INSTRUCTIONS: Be the player to pick up the last stick
You can only pick up one (1) or two (2)
sticks at a time...

11 sticks remain. How many would you like to pick up?

1 or 2: 2
Comp chooses: -99 Based On Value: -2147483647

108 sticks remain. How many would you like to pick up?

1 or 2: 2

Comp chooses: -99 Based On Value: -2147483647

205 sticks remain. How many would you like to pick up?

1 or 2: Comp chooses: -99 Based On Value: -2147483647

302 sticks remain. How many would you like to pick up?

1 or 2: 2
Comp chooses: -99 Based On Value: -2147483647

399 sticks remain. How many would you like to pick up?

1 or 2:

[ronschmick]

hi do you gave this code posted anywhere? Do you have it on get?

[clashofclanswithitay]

why cant you use def infinty; while True:; pass;