Adversarial search and minimax - Learning How AI works in Harvard's EAD
All of the search algorithms we were looking at were what I like to call "single player algorithms", as we have only one doing the inputs and changing the scenery, but many times, our AI has to work against something, may this be a World Renewed Chess Player or another AI, it has to not just consider it's actions, but the opposing players actions too, and we need to put the result into a format an AI can understand by turning it into a value with a MINimum or MAXimum value, to see wether it won or lost.
Harvard's EAD (the one I am learning from):
https://learning.edx.org/course/course-v1:HarvardX+CS50AI+1T2020/home
If you have any question or suggestion on other topics, feel free to comment down below or ask me in Facebook or Instagram!
Visit my Facebook Page in: http://fb.com/teteusbionicoficial
Visit my Instagram: https://www.instagram.com/teteusbionic/
Visit my Website: http://www.teteusbionic.com.br