Autor:	Lagerkvist, Mikael Zayenz
Rok vydání:	2020
Předmět:	Computer Science - Artificial Intelligence
Druh dokumentu:	Working Paper
Popis:	Modern board games are a rich source of interesting and new challenges for combinatorial problems. The game Nmbr9 is a solitaire style puzzle game using polyominoes. The rules of the game are simple to explain, but modelling the game effectively using constraint programming is hard. This abstract presents the game, contributes new generalized variants of the game suitable for benchmarking and testing, and describes a model for the presented variants. The question of the top possible score in the standard game is an open challenge. Comment: Abstract at the 25th International Conference on Principles and Practice of Constraint Programming
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2001.04238 Zobrazit plný text záznamu View this record from Arxiv