The famous AlphaGo program defeated one of the best Go players, Lee Sedol 4-1. What key algorithms did AlphaGo use? a. Alpha beta pruning b. Monte Carlo tree search c. Deep neural networks d. Breadth first Search

Which of the following is/are true about the minimax algorithm with alpha-beta pruning? Assume a 2-player game where the only outcomes are win, loss or draw. An algorithm is called complete when, if there is a way for the player ...