vix.ing · top · new · best · stats · spec

NP-completeness of the game Kingdomino

2019/09/06 by Viet-Ha Nguyen, Nguyen, Viet-Ha, Kevin Perrot +3 · 2 voices
Computer Science · #Computational Complexity (cs.CC) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #cs.CC #cs.DM

paper · pdf · doi:10.48550/arxiv.1909.02849

arxiv published 2019/09/06 · arxiv updated 2020/03/31

Abstract

Kingdomino is a board game designed by Bruno Cathala and edited by Blue Orange since 2016. The goal is to place 2 × 1 dominoes on a grid layout, and get a better score than other players. Each 1 × 1 domino cell has a color that must match at least one adjacent cell, and an integer number of crowns (possibly none) used to compute the score. We prove that even with full knowledge of the future of the game, in order to maximize their score at Kingdomino, players are faced with an NP-complete optimization problem.

Discussions

Related