Nonograms, also known as Japanese puzzles, are logic puzzles that are sold by many news paper vendors. The challenge is to fill a grid with black and white pixels in such a way that a given description for each row and column, indicating the lengths of consecutive segments of black pixels, is adhered to. Although the Nonograms in puzzle books can usually be solved by hand, the general problem o...

The objective of this experiment was to use multiple Flockbots to solve sokoban puzzles in parallel (a multibody simulation with a central planner). The simulation takes place an 8x7 grid that we constructed. Each grid space has a QR code in it for localization. There are three main components to solving the problem: the centralized planner, which finds a solution to the puzzle and coordinates ...

An active area of research in computational science is the design algorithms for solving subgraph matching problem to find copies a given template graph larger world graph. Prior works have largely addressed single-channel networks using variety approaches. We present suite filtering methods isomorphisms multiplex (with different types edges between nodes and more than one edge within each chan...

We attacked the problem of solving crossword puzzles by computer: given a set of clues and a crossword grid, try to maximize the number of words correctly lled in. In our system, \expert modules" specialize in solving speci c types of clues, drawing on ideas from information retrieval, database search, and machine learning. Each expert module generates a (possibly empty) candidate list for each...

We present a new proof of NP-completeness for the problem of solving instances of the Japanese pencil puzzle Kakuro (also known as Cross-Sum). While the NP-completeness of Kakuro puzzles has been shown before [T. Seta. The complexity of CROSS SUM. IPSJ SIG Notes, AL-84:51–58, 2002], there are still two interesting aspects to our proof: we show NP-completeness for a new variant of Kakuro that ha...

This paper reports on the computational analysis of thin slices of video fragments showing children that solve either easy or hard mathematical puzzles. The objective of the analysis is to determine if head movements reveal whether the children consider the puzzle to be easy or hard. Our analysis method combines a facial-expression extraction method with a nonparametric classifier. Training and...

Computational thinking sits at the core of every engineering and computing related discipline. It has increasingly emerged as its own subject in all levels of education. It is a powerful cornerstone for cognitive development, creative problem solving, algorithmic thinking and designs, and programming. How to effectively teach computational thinking skills poses real challenges and creates oppor...

Heyawake is one of many recently popular Japanese pencil puzzles. We investigate the computational complexity of the problem of deciding whether a given puzzle instance has a solution or not. We show that Boolean gates can be emulated via Heyawake puzzles, and that it is possible to reduce the Boolean Satisfiability problem to Heyawake. It follows that the problem in question is NP-complete.

An automated assembling of shredded/torn documents (2D) or broken pottery (3D) will support philologists, archaeologists and forensic experts. Especially if the amount of fragments is large (up to 1000), the compilation will not be feasible for a human puzzle solver due to cost and time. Approaches to solve the task of fragmented objects or puzzles can be divided into shape based matching techn...

Humans possess an ability to abstractly reason about objects and their interactions, an ability not shared with state-of-the-art deep learning models. Relational networks, introduced by Santoro et al. (2017), add the capacity for relational reasoning to deep neural networks, but are limited in the complexity of the reasoning tasks they can address. We introduce recurrent relational networks whi...