What is the Minimax Algorithm?
An algorithm used in game playing where one opponent tries to maximise their chance of winning and minimise their opponent's chance at every move
Talk through how the MiniMax algorithm works (different for different problems of course)
Set of values at terminal positions (triangles) at the bottom.
Level above is the last player who played a move
If + value is PC winning and they played the last move, we move every positive value up to their parents
If - value is ME winning, on the level above that, move the smaller values up to their parents
Keep going until you reach the root