O meu artigo designado “Playing BlokusDuo in a ZYNQ Device: A Quest for an Efficient Algorithm” foi aceite na conferência REC’2020, que terá lugar em Lisboa, Portugal, de 10 a 11 de fevereiro.
Este artigo foi escrito no contexto da competição de BlokusDuo que terá lugar durante a conferência.
Sumário (apenas em inglês):
In the context of game theory, there are several algorithms whose purpose is to play strategies that, hopefully, lead to the victory of whoever uses them. Through the implementation of many of these algorithms, Nikolakaki concluded that the Monte Carlo Tree Search algorithm leads to the best results for the game BlokusDuo. This work exploits the MCTS algorithm as well as the properties of BlokusDuo in an attempt to create an efficient algorithm that allows playing the game using the limited resources of an embedded system. Results show that the implemented solution allows placing 76 % of the game pieces in 53 % of the time, and that, given different time budgets for calculating the next move, the player with the higher time budget has a higher probability of winning the game.