Soduka puzzle.
A puzzle where a 3x3 grid must contain the numbers 1…9 without repeating any number within the grid nor the row or column.
The purpose of my assignment is to build an inteligent system to solve the puzzle.
Anything goes. 
I’m using a GA to solve the problem.
It’s due on October the 7th.
The ones I’ve seen had a 9x9 board divided into 9 3x3 subboards, each of which must contain all numbers from 1…9, positioned such that each row and column in the 9x9 board contains each number from 1…9.
I suppose that’s what you meant?
Yep.
So far I figured this out:
I’ve found out how a genetic algorithm can solve Sudoku.
It’s simple, each chromosome is a vertex with 2 coordinates. These coordinates can have numbers 1-9.
Each coordinate (x, y) are genes.
A vertex tree can be formed from these vertices.
The vertices can all touch each other(line drawn from one to another until they form a solid state) if the constraints are met, which are defined by the Sudoku rules.
All I have to do is have the GA algorithm generate vertices until a tree can be formed.
This could be achieved with a very simple rule system or a neural net.
The biggest problem with this would be the performance hit of building a tree and iterating through it.
The tree would have to be built and re-iterated at every run, this will have an exponential performance hit.