AI Chat AI Image Generator AI Video Text to Speech

Dota Underlords game is NP-complete

07/09/2020

∙

by Alexander A. Ponomarenko, et al.

∙

∙

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.

Alexander A. Ponomarenko
1 publication
Dmitry V. Sirotkin
1 publication

page 1

page 2

page 3

page 4

research

∙ 06/09/2019

The Packed Interval Covering Problem is NP-complete

We introduce a new decision problem, called Packed Interval Covering (PI...

0 Abdallah Saffidine, et al. ∙

research

∙ 04/08/2022

Finding a Winning Strategy for Wordle is NP-complete

In this paper, we give a formal definition of the popular word-guessing ...

0 Will Rosenbaum, et al. ∙

research

∙ 06/29/2019

Ludii and XCSP: Playing and Solving Logic Puzzles

Many of the famous single-player games, commonly called puzzles, can be ...

0 Cédric Piette, et al. ∙

research

∙ 11/10/2022

Complexity of Chess Domination Problems

We study different domination problems of attacking and non-attacking ro...

0 Alexis Langlois-Rémillard, et al. ∙

research

∙ 09/06/2019

NP-completeness of the game Kingdomino

Kingdomino is a board game designed by Bruno Cathala and edited by Blue ...

0 Viet-Ha Nguyen, et al. ∙

research

∙ 09/21/2013

The multi-vehicle covering tour problem: building routes for urban patrolling

In this paper we study a particular aspect of the urban community polici...

0 Washington Alves de Oliveira, et al. ∙

research

∙ 12/16/2013

Strategic Argumentation is NP-Complete

In this paper we study the complexity of strategic argumentation for dia...

0 Guido Governatori, et al. ∙