So I managed to hand in my Statement of Intent on time. All is well and I just met with Conor McBride (my supervisor). He gave me some pointers.
I need to write a few new methods for my sudoku solver program. First off I need to keep a copy of the original board stored somewhere so that I know what moves are mine to make and what moves are not supposed to be changed. I need to write a method to tell if I am 'Busted' or if the move is fine. I'll write a method called last good square that will take the current position and move backwards to determine what the last move made was. I'll need to store a list of the moves made (maybe not, this will just be another board). I also want to know how to iterate through each square and reach a solution. I would like to know what possible numbers I can put in each square. I don't think it'd be wise to create 81 different arrays, but maybe after filling in the original grid I could create a new grid which would be an array of arrays! When each array is created it would check what possible numbers could go into that space and then give it a definite size (i.e. only 2,4,7 can go in here so it will create an array of size 3 with [2,4,7]). Well this is some food for thought. Time to be bored for a bit.
