4.6 Article

Computational design of polyomino puzzles

期刊

VISUAL COMPUTER
卷 37, 期 4, 页码 777-787

出版社

SPRINGER
DOI: 10.1007/s00371-020-01968-5

关键词

Computational design; Graph partitioning; Puzzles

资金

  1. JSPS KAKENHI [19K24338, 20K19944]
  2. Grants-in-Aid for Scientific Research [20K19944, 19K24338] Funding Source: KAKEN

向作者/读者索取更多资源

This paper introduces a computational approach for designing geometric puzzles that differs from existing methods by using a top-down partitioning approach, allowing control and editing of piece shapes instead of automatic generation. The proposed algorithm can be easily extended to both 3D polycube and 2D polyomino puzzle design, demonstrating versatility and innovation in puzzle design.
People of all ages enjoy solving geometric puzzles. However, finding suitable puzzles, e.g., puzzles with a moderate level of difficulty or puzzles with intellectually stimulating shapes can be difficult. In addition, designing innovative and appealing puzzles requires demanding effort and, typically, involves many trial and error processes. In this paper, we introduce a computational approach for designing geometric puzzles. Existing approaches employ bottom-up, constructive algorithms to generate puzzle pieces; therefore, intervening in the piece generation procedure is difficult. Differing from existing approaches that generate puzzles automatically or semi-automatically, we propose a top-down, partitioning-based approach, that enables us to control and edit piece shapes. With a subtle modification, the proposed algorithm can be easily extended to both 3D polycube and 2D polyomino puzzle design. To generate a variety of piece shapes, the proposed approach involves a capacity-constrained graph partitioning algorithm combined with polyomino tiling. We demonstrate the versatility of the proposed approach through various example designs, including fabricated puzzles, created using the proposed method.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据