Comparison of Expectimax and Monte Carlo algorithms in Solving the online 2048 game
In this work, two search algorithms Expectimax and Monte Carlo Tree Search (MCTS) were developed to solve the well-known “2048" puzzle online-game and compare their results. In both cases, five heuristics were employed to obtain favorable tile positions within the game. These heuristics were co...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | Spanish |
| Published: |
Universidad Nacional Mayor de San Marcos
2018-09-01
|
| Series: | Pesquimat |
| Subjects: | |
| Online Access: | http://revistasinvestigacion.unmsm.edu.pe/index.php/matema/article/view/15069 |