Dota Underlords game is NP-complete
From MaRDI portal
Publication:6344781
arXiv2007.05020MaRDI QIDQ6344781
Alexander A. Ponomarenko, Dmitry V. Sirotkin
Publication date: 9 July 2020
Abstract: In this paper, we demonstrate how the problem of the optimal team choice in the popular computer game Dota Underlords can be reduced to the problem of linear integer programming. We propose a model and solve it for the real data. We also prove that this problem belongs to the NP-complete class and show that it reduces to the maximum edge weighted clique problem.
Has companion code repository: https://github.com/aponom84/UnderLords
This page was built for publication: Dota Underlords game is NP-complete
