Paper Title:
Implementation of Heuristic Technique and Genetic Algorithms in Shikaku Puzzle Problem
  Abstract

Shikaku is a logic puzzle published by Nikoli at 2005. Shikaku has a very simple rule. This puzzle is played on a rectangular grid. Some of the squares in the grid are numbered. The main objective is to create partitions inside the grid. Each partition must have exactly one number, and the number represents the area of the partition. Then the partition’s shape must be a rectangular or a square. The aim of this research is discussing how can computer software be able to solve the Shikaku problem by implementing heuristic technique and genetics algorithms. Initially the Shikaku problem is inputted into the system. Firstly, the software will solve the problem by applying heuristics methods with some logic rules. All logic rules are created and implemented into the software so that the software can minimize the partitions possibilities to the problem. If this heuristics method still can not solve the problem then genetic algorithms will be executed to find the solution. This paper elaborates from how the problem be modelled and also be implemented until software testing to ensure that the solver worked as expected. The implementation consists of a virtual puzzle board with three different size, genetic algorithms parameters, and ability to create, save, load, and solve puzzle. Software testing is conducted to find how fast the system can solve the problem.

  Info
Periodical
Edited by
Qi Luo
Pages
1860-1865
DOI
10.4028/www.scientific.net/AMM.58-60.1860
Citation
S. Lukas, A. Aribowo, S. C. Halim, "Implementation of Heuristic Technique and Genetic Algorithms in Shikaku Puzzle Problem", Applied Mechanics and Materials, Vols. 58-60, pp. 1860-1865, 2011
Online since
June 2011
Export
Price
$32.00
Share

In order to see related information, you need to Login.

In order to see related information, you need to Login.

Authors: Min Chen, Chan Juan Yin, Yu Ping Xi
Abstract:K-means is a classic algorithm of partition clustering, its speed is very fast, well, the clustering result is very sensitive to the initial...
577
Authors: Ai Min Hou, Chuan Fu Hu, Zhi Feng Hao
Chapter 5: Computing Methods and Algorithms, Automation and Information Technologies, CAD Applications
Abstract:A general depth-first backtracking algorithm for graph isomorphism with the vertex partition and refinement technique is presented in this...
1919
Authors: Jia Yi Zang
Chapter 3: Power Systems, Electronics and Microelectronics, Embedded and Integrated Systems, Communication
Abstract:In power system state estimation, bad data of local area can make state estimation difficult, and accuracy of measurement can also have great...
2077