Chess Engine in Python - Part 12 - Greedy Algorithm and MinMax without recursion

In this video we start to build our main AI functionality. First, we look at a greedy algorithm, where the AI just tries to gain the most material it can on that turn. Then, we make it a bit smarter, by looking at our opponents moves in return. *Sorry the audio quality on the last video wasn't great, should be better on this one*