AI PROGRAMMING PROJECT USING PYTHON

Tenner Grid is a Mathematical puzzle that consists of a rectangular grid of

width ten cells. The task is to fill in the grid so that each row contains the

numbers $0$ to $9.$ Numbers must not be repeated in rows. In columns the numbers

may be repeated and the numbers in a column must add up to a given target

sum. Therefore, the bottom numbers give the sum of the numbers in column.

The digits in contiguous cells $($even diagonally contiguous cells$)$ must be

different.

The rules of Tenner Grids math puzzles:

$1.$ Numbers appear only once in a row.

$2.$ Numbers may be repeated in columns.

$3.$ Numbers in the columns must add up to the given sums.

$4.$ Numbers in connecting cells must be different.

Write an AI program to generate and solve the game Tenner Grid by modelling

it as constraint satisfaction problem. Your program must solve a randomly

generated Tenner Grid Puzzle in Simple backtracking, Forward checking,

Forward checking with MRV heuristic. You can configure your program to

either solve $10$ by $3$ Tenner Grid Puzzles, $10$ by $4$ Tenner Grid Puzzles, $10$ by $5$

Tenner Grid Puzzles, or $10$ by $6$ Tenner Grid Puzzles.

For each algorithm, show the initial state $($randomly generated state$),$ final CSP

Tenner variable assignments, number of variable assignments and number of

consistency checks, the solution found $($final state$),$ and time used to solve the

problem.

Conduct a comparison of various CSP algorithms $($Backtracking$,$ Forward

Checking, and FC$+$MRV$)$ on Tenner Grid problem.

Analyze the median number of consistency checks $($over five runs$)$ required to

solve the problem and show the results in term of which algorithm is better to

solve the problem.