Minimax Algorithm in Game Playing | Artificial Intelligence

24 thoughts on “Minimax Algorithm in Game Playing | Artificial Intelligence”

1. Explain with very easily nice sir

2. very nice explanation varun sir….thankyou

3. SRM BOYS?

4. Very Helpful…Thanks!

5. mind blowing sir g !pray for us kal hamara exam ha

6. thanku sir

7. The best thing about these videos is there are no too many annoying ads. Yes, it is acceptable to have ads in the video but too many ads really ruin your content and distract one from the point. These videos are maintaining their quality.👍
   One video ad at the beginning and one at the end and maybe one or two display ad in the middle that's enough for a 12-13 minute video.

8. What's up Nirma Fam!?

9. i have premium account of you tube so i never face add and without add we can understand better ..thanks so much sir

10. Bari zabardast video hae G… preparing for papers currently…

11. i have one doubt that is.aap ne staring me kaha ki best utility leni hai (leaf node=8) but last me humne C ko choose karke utility(leaf node=2) kam kardi ? however video is very good.

12. Thank u so much sir excellence

13. best video understanding ever… Thanks

14. thank you so much ❤👍

15. repetitions

16. Talented sir

17. Really explained well Sir👍

18. Thank you 😁😁

19. I dont understand anything 🙁 which this was in english: Youhave awesome comments.

20. Thank you so much sir because you are teaching better than our lectures

21. Sir.. Your way Of Teaching… 👌👌👌👌👌
    Understood clearly 😊

22. If the opponent makes a mistake, will the Mini-max still work? -> It can happen and it might give us better utility value.

23. sir utility ki value koi bhi ho sakti hai?

24. v informative and simplest method to understand AI.. Thanks Sir

Comments are closed.