Sciweavers

598 search results - page 3 / 120
» The Puzzle Layout Problem
Sort
View
ICPR
2008
IEEE
13 years 11 months ago
Assembly of puzzles by connecting between blocks
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...
Takenori Murakami, Fubito Toyama, Kenji Shoji, Jui...
CP
2005
Springer
13 years 10 months ago
Applying Decomposition Methods to Crossword Puzzle Problems
Abstract. In this paper, we investigate the performance of several existing structural decomposition methods on fully interlocked Crossword Puzzle Problems (CPPs) and draw directio...
Yaling Zheng, Berthe Y. Choueiry
CEC
2007
IEEE
13 years 8 months ago
Solving, rating and generating Sudoku puzzles with GA
This paper studies the problems involved in solving, rating and generating Sudoku puzzles with genetic algorithms (GA). Sudoku is a number puzzle that has recently become a worldwi...
Timo Mantere, Janne Koljonen
CVPR
2011
IEEE
12 years 8 months ago
A fully automated greedy square jigsaw puzzle solver
In the square jigsaw puzzle problem one is required to reconstruct the complete image from a set of non-overlapping, unordered, square puzzle parts. Here we propose a fully automa...
Dolev Pomeranz, Michal Shemesh, Ohad Ben-Shahar
CORR
2007
Springer
98views Education» more  CORR 2007»
13 years 4 months ago
The Three-Color and Two-Color Tantrix(TM) Rotation Puzzle Problems are NP-Complete via Parsimonious Reductions
Abstract. Holzer and Holzer [7] proved that the TantrixTM rotation puzzle problem with four colors is NP-complete, and they showed that the infinite variant of this problem is und...
Dorothea Baumeister, Jörg Rothe