Sudoku is a kind of logic puzzles. Each puzzle consists

\r\nof a board, which is a 9×9 cells, divided into nine 3×3 subblocks

\r\nand a set of numbers from 1 to 9. The aim of this puzzle is to

\r\nfill in every cell of the board with a number from 1 to 9 such

\r\nthat in every row, every column, and every subblock contains each

\r\nnumber exactly one. Sudoku puzzles belong to combinatorial problem

\r\n(NP complete). Sudoku puzzles can be solved by using a variety of

\r\ntechniques\/algorithms such as genetic algorithms, heuristics, integer

\r\nprogramming, and so on. In this paper, we propose a new approach for

\r\nsolving Sudoku which is by modelling them as block-world problems.

\r\nIn block-world problems, there are a number of boxes on the table

\r\nwith a particular order or arrangement. The objective of this problem

\r\nis to change this arrangement into the targeted arrangement with the

\r\nhelp of two types of robots. In this paper, we present three models

\r\nfor Sudoku. We modellized Sudoku as parameterized multi-agent

\r\nsystems. A parameterized multi-agent system is a multi-agent system

\r\nwhich consists of several uniform\/similar agents and the number of

\r\nthe agents in the system is stated as the parameter of this system. We

\r\nuse Temporal Logic of Actions (TLA) for formalizing our models.<\/p>\r\n","references":null,"publisher":"World Academy of Science, Engineering and Technology","index":"Open Science Index 80, 2013"}