Solving tangram puzzles: A connectionist approach
نویسندگان
چکیده
منابع مشابه
Solving tangram puzzles: A connectionist approach
We present a connectionist approach for solving Tangram puzzles. Tangram is an ancient Chinese puzzle where the object is to decompose a given figure into seven basic geometric figures. One connectionist approach models Tangram pieces and their possible placements and orientations as connectionist neuron units which receive excitatory connections from input units defining the puzzle and lateral...
متن کاملA probabilistic approach to solving crossword puzzles
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 filled in. After an analysis of a large collection of puzzles, we decided to use an open architecture in which independent programs specialize in solving specific types of clues, drawing on ideas from information retrieval, database search, a...
متن کاملA Global Approach for Solving Edge-Matching Puzzles
We consider apictorial edge-matching puzzles, in which the goal is to arrange a collection of puzzle pieces with colored edges so that the colors match along the edges of adjacent pieces. We devise an algebraic representation for this problem and provide conditions under which it exactly characterizes a puzzle. Using the new representation, we recast the combinatorial, discrete problem of solvi...
متن کاملA Retrievable GA for Solving Sudoku Puzzles A Retrievable GA for Solving Sudoku Puzzles
In this paper we propose a modification to Genetic Algorithm which we call as Retrievable Genetic Algorithm (Ret-GA) and use it to solve a given Sudoku puzzle. Although a number of approaches exist for solving a given Sudoku puzzle, very few papers with heuristic approaches are available for obtaining its solution. In this work, the fitness function is modeled in a new way considering puzzle-ch...
متن کاملAn Improved Heuristic-based Approach for Solving Square Jigsaw Puzzles
An algorithm for assembling square jigsaw puzzles is presented. We commence by introducing criteria that govern the selection of proper jigsaw puzzle solving method for a given application. Our algorithm uses the gray level profiles of border pixels for local matching of the puzzle pieces. Unlike the classical best-first search, the algorithm simultaneously locates the neighbors of a puzzle pie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Intelligent Systems
سال: 1993
ISSN: 0884-8173,1098-111X
DOI: 10.1002/int.4550080502