A picture-logic puzzle is a game that takes the form of an N M grid, with numbers situated on the left of its rows and on the top of its columns, which give the clues for solving the puzzle. These puzzles have gained popularity in the last years all over the world, and there are companies involved in the commercialization of products related to them, mainly magazines, on-line puzzles via the we...

For this project, I implemented the genetic algorithm-based jigsaw puzzle solver described in “A Genetic Algorithm-Based Solver for Very Large Jigsaw Puzzles” by Sholomon et al [1]. This method involves producing a “child” solution from two “parent” solutions by detecting, extracting, and combining correctly assembled puzzle pieces. The solver developed by the paper’s team is able to accurately...

Sudoku is a very simple and well-known puzzle that has achieved international popularity in the recent past. This project addresses the problem of encoding Sudoku puzzles into conjunctive normal form (CNF), and subsequently solving them using polynomial-time propositional satisfiability (SAT) inference techniques. We introduce two straightforward SAT encodings for Sudoku: the minimal encoding a...

Jigsaw puzzles [9] and edge-matching puzzles [5] are two ancient types of puzzle, going back to the 1760s and 1890s, respectively. Jigsaw puzzles involve fitting together a given set of pieces (usually via translation and rotation) into a desired shape (usually a rectangle), often revealing a known image or pattern. The pieces are typically squares with a pocket cut out of or a tab attached to ...

This paper discusses solving and generating Sudoku puzzles with evolutionary algorithms. Sudoku is a Japanese number puzzle game that has become a worldwide phenomenon. As an optimization problem Sudoku belongs to the group of combinatorial problems, but it is also a constraint satisfaction problem. The objective of this paper is to test if genetic algorithm optimization is an efficient method ...

Cryptographic puzzles (or client puzzles) are moderately difficult problems that can be solved by investing non-trivial amounts of computation and/or storage. Devising models for cryptographic puzzles has only recently started to receive attention from the cryptographic community as a first step toward rigorous models and proofs of security of applications that employ them (e.g. Denial-of-Servi...