TY - JFULL AU - Cecilia Nugraheni and Luciana Abednego PY - 2013/9/ TI - Modelling Sudoku Puzzles as Block-world Problems T2 - International Journal of Computer and Information Engineering SP - 1123 EP - 1130 VL - 7 SN - 1307-6892 UR - https://publications.waset.org/pdf/16224 PU - World Academy of Science, Engineering and Technology NX - Open Science Index 80, 2013 N2 - Sudoku is a kind of logic puzzles. Each puzzle consists of a board, which is a 9×9 cells, divided into nine 3×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 techniques/algorithms 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 block-world problems. In block-world 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 multi-agent systems. A parameterized multi-agent system is a multi-agent system which consists of several uniform/similar 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. ER -