#AI-2048 Game Solver This is a python program for solving 2048 game.The minimax with alpha-beta pruning could help the AI to search nodes more evenly through each move. When do searching without alpha-beta pruning, the AI could typically run deeper to 10 - 15 layers to leftmost. While with alpha-beta pruning, the AI could be able to spread its search, instead of only digging one path all the way done. I also add depth limit, and help the AI to spread. For both minimax and the one with pruning, I test the total nodes it goes through for each round, and the total nodes searched are all about 70 - 100. In other words, the AI uses the same time to go more 'BFS' than 'DFS' when using pruning.