Sudoku game

Koya University
Software Engineering Department
4th Stage
Artificial Intelligence

Sudoku Game

Prepared by Kewan S. Salih

Introduction
Sudoku (Digit-single) originally called Number Place, is a logic-based, combinatorial number-placement puzzle. The objective is to fill a 9×9 grid with digits so that each column, each row, and each of the nine 3×3 sub-grids that compose the grid (also called "boxes", "blocks", "regions", or "sub-squares") contains all of the digits from 1 to 9. The puzzle setter provides a partially completed grid, which typically has a unique solution. [Wikipedia]

Figure Example & Solution
A typical Sudoku puzzle grid, with nine rows and nine columns that intersect at square spaces.
Some of the spaces are pre-filled with one number each; others are blank spaces for a solver to fill with a number.
The original Sudoku solves the following three conditions:
1. The value of each column is unique
2. The value of each row is unique
3. The amount per square N * N is a unique internal[-http://www.cs.huji.ac.il]

Percepts
The Sudoku Game percepts are:
1-The field of Sudoku environment matrix is blank
2-The field of Sudoku environment matrix is not blank
3-The value of each filled row is unique
4-The value of each filled row is not unique
5-The value of each filled column is unique
6-The value of each filled column is not unique
7-The summation per each square is unique
8- The summation per each square is not unique
9- The candidate value includes in this range v>=1 and v=1 and v=1 and v9 || a1==a(1,1)) a(1,2)=0; else a(1,2)=a1; end if( a2>9 || (a2==a(1,2) || a2==a(2,1)) ||a2==a(1,1)) a(2,2)=0; else a(2,2)=a2; end a

References:
1-Wekipedia
2-http://www.cs.huji.ac.il

References: 1-Wekipedia 2-http://www.cs.huji.ac.il