We discuss some new geometric puzzles and the complexity of their extension to arbitrary sizes. For gate puzzles and two-layer puzzles we prove NP-completeness of solving them. No...
Helmut Alt, Hans L. Bodlaender, Marc J. van Krevel...
— A novel client puzzle protocol, the Memoryless Puzzle Protocol (MPP), is proposed and investigated. The goal is to show that MPP is a viable solution for mitigating distributed...
Nicholas A. Fraser, Douglas J. Kelly, Richard A. R...
In this paper, we proposed a method for solving the rectangle piece jigsaw puzzle assembly problem. A shape of a piece is a rectangle, and a puzzle image is RGB full color. The as...