论文标题
NMBR9作为约束编程挑战
Nmbr9 as a Constraint Programming Challenge
论文作者
论文摘要
现代棋盘游戏是对组合问题的有趣和新挑战的丰富来源。游戏NMBR9是使用多支着多元粉的纸牌风格的益智游戏。游戏规则很容易解释，但是使用约束编程有效地对游戏进行建模很难。该摘要展示了游戏，为游戏的新广义变体提供了适合基准测试和测试的新广义变体，并描述了呈现的变体的模型。标准游戏中最高得分的问题是一个公开挑战。
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.
