Open Access
A Discrete Tomography Approach to Japanese Puzzles
Reads0
Chats0
TLDR
It is shown that the famous Japanese puzzles are a special case of a more general DT problem and an evolutionary algorithm for computing such reconstructions is applied.Abstract:
Discrete Tomography (DT) is concerned with the reconstruction of binary images from their horizontal and vertical projections. In this paper we consider an evolutionary algorithm for computing such reconstructions.We show that the famous Japanese puzzles are a special case of a more general DT problem and successfully apply our algorithm to such puzzles.read more
Citations
More filters
Journal ArticleDOI
Solving Nonograms by combining relaxations
TL;DR: A reasoning framework is proposed that can be used to determine the value of certain pixels in the puzzle, given a partial filling, and is capable of solving a variety of Nonograms that cannot be solved by simple logic reasoning within individual rows and columns, without resorting to branching operations.
Book ChapterDOI
Network Flow Algorithms for Discrete Tomography
TL;DR: In this paper, the authors describe how network flow algorithms can be used to solve a variety of problems from discrete tomography and present an algorithm for reconstructing 0-1 images from more than two projections.
Journal ArticleDOI
Technical Section: Automated generation and visualization of picture-logic puzzles
Emilio G. Ortiz-García,Sancho Salcedo-Sanz,J.M. Leiva-Murillo,Ángel M. Pérez-Bellido,Jose A. Portilla-Figueras +4 more
TL;DR: This paper proposes algorithms for the automated generation of picture-logic puzzles (both black and white and color puzzles), starting from any digital RGB color image, and presents a visualization interface which provides several useful tools for finishing the puzzle generation process.
Journal ArticleDOI
Teaching Advanced Features of Evolutionary Algorithms Using Japanese Puzzles
Sancho Salcedo-Sanz,Jose A. Portilla-Figueras,Emilio G. Ortiz-García,Ángel M. Pérez-Bellido,Xin Yao +4 more
TL;DR: It is shown that Japanese puzzles are constrained combinatorial optimization problems, that can be solved using EAs with different encodings, and are challenging problems for EAs.
Journal ArticleDOI
An efficient algorithm for solving nonograms
TL;DR: This paper uses the chronological backtracking algorithm to solve those undetermined cells and logical rules to improve the search efficiently, and can determine that a nonogram has no solution.
References
More filters
Journal ArticleDOI
Book review: Genetic Algorithms + Data Structures = Evolution Programs by Zbigniew Michalewicz (Springer-Verlag, 1992)
Book ChapterDOI
Combinatorial Properties of Matrices of Zeros and Ones
TL;DR: In this paper, a matrix A of m rows and n columns, all of whose entries are 0's and 1's, is considered, and the sum of row i of A is denoted by r i (i = 1,..., m) and sum of column n of A are denoted as s i (1, n, n).
Journal ArticleDOI
An evolutionary algorithm for discrete tomography
TL;DR: This paper presents an evolutionary algorithm for finding the reconstruction which maximises an evaluation function, representing the ''quality'' of the reconstruction, and shows that the algorithm can be successfully applied to a wide range of evaluation functions.