Sudoku solver program, do it like a human!

[audioinstinct]

Hmm that is strange. I will however forward this information to site administrator.

Thanks for that.

Anyway, right now I'm thinking about a recursive approach to build the chain itself, a function would call itself for each candidate from 1-9 and build a chain of strong links which would return an array at the end which I could then easily check for possibilities. Well, it definitely sounds more simple than it is , but I think this will be most efficient way because with recursion I can ignore factors such as how many instances of the candidate exists and what's the relation of every single one of them to all the others which would just further complicate and add completely unnecessary loops into the procedure. Aaaand I need to step up my recursion capabilities anyway because I've never really written anything recursive harder than a factorial, lol.