NP-completeness of the game Kingdomino - Archive ouverte HAL Access content directly
Journal Articles Theoretical Computer Science Year : 2020

NP-completeness of the game Kingdomino

(1, 2, 3) , (4, 3) , (4)
1
2
3
4

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.

Dates and versions

hal-03121418 , version 1 (26-01-2021)

Identifiers

Cite

Viet-Ha Nguyen, Kévin Perrot, Mathieu Vallet. NP-completeness of the game Kingdomino. Theoretical Computer Science, 2020, 822, pp.23-35. ⟨10.1016/j.tcs.2020.04.007⟩. ⟨hal-03121418⟩
78 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More