Dota Underlords game is NP-complete
Combinatorics
2020-07-13 v1 Computational Complexity
Discrete Mathematics
Optimization and Control
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.
Cite
@article{arxiv.2007.05020,
title = {Dota Underlords game is NP-complete},
author = {Alexander A. Ponomarenko and Dmitry V. Sirotkin},
journal= {arXiv preprint arXiv:2007.05020},
year = {2020}
}