PROJECT

started doing the project today Started with description of A* algorithm

PROBLEM N0:231
aiming to solve

PROBLEM :148 PROJECT EULER

I solved it yes i solved it
the question strongly shows the power of recursion
it filled me with new confidence because
after all this is my first euler problem this semester
Now I started moving fastly with other problems

FAILURE

I tried to learn the algorithm but all are pointing to some other thing but not to the thing that solves sudoku so i was not able to learn it

FASCINATING GRAPH COLORING ALGORITHM
Now i am going to learn the graph coloring algorithm
basically there are more algorithm to find chromatic number than to give the combination the chromatic number is the minimum number of colors needed to paint the graph with vertexes
for solving sudoku we need to paint the vertexes with colours from a list so i will now try to study the list colouring algorithms and then try to implement them