bipinkh/2048-puzzle

adversarial search and games

2048-puzzle

• use vanilla manimax and manimax with alpha-beta pruning to solve 2048-puzzle
• every move has 0.2s time limit, so use iterative deepening search (ids) to search as deep as possible
• combine various heuristic functions to achieve larger maximum tile, eg. 2048, 4096
• file "result" contains sample results when trying out different combinations of heuristic functions
• visit http://gabrielecirulli.github.io/2048/ to get fimilar with the game
• detailed instruction is shown in file "assignment2"