Cecilia Nugraheni and Luciana Abednego
Modelling Sudoku Puzzles as Blockworld Problems
1124 - 1130
2013
7
8
International Journal of Computer and Information Engineering
https://publications.waset.org/pdf/16224
https://publications.waset.org/vol/80
World Academy of Science, Engineering and Technology
Sudoku is a kind of logic puzzles. Each puzzle consists
of a board, which is a 9&times;9 cells, divided into nine 3&times;3 subblocks
and a set of numbers from 1 to 9. The aim of this puzzle is to
fill in every cell of the board with a number from 1 to 9 such
that in every row, every column, and every subblock contains each
number exactly one. Sudoku puzzles belong to combinatorial problem
(NP complete). Sudoku puzzles can be solved by using a variety of
techniquesalgorithms such as genetic algorithms, heuristics, integer
programming, and so on. In this paper, we propose a new approach for
solving Sudoku which is by modelling them as blockworld problems.
In blockworld problems, there are a number of boxes on the table
with a particular order or arrangement. The objective of this problem
is to change this arrangement into the targeted arrangement with the
help of two types of robots. In this paper, we present three models
for Sudoku. We modellized Sudoku as parameterized multiagent
systems. A parameterized multiagent system is a multiagent system
which consists of several uniformsimilar agents and the number of
the agents in the system is stated as the parameter of this system. We
use Temporal Logic of Actions (TLA) for formalizing our models.
Open Science Index 80, 2013