Suppose, I got a hypothetical fixed list of all possible general Sudoku puzzles. I then create the pseudo-code to demonstrate the algorithm.
The algorithm does a search to compare the indexes of elements in the puzzle that are not listed as zero.
In other words, all the possible listed Sudoku
grids are compared until a solution is found matching solution sharing the elements with the
tuple=[.......] tuple=[.......] all possible Sudoku grids. Here's our solver. solver = input('enter the puzzle like this 10000030004000...) if Element with Same Index solver == tuple1, tuple2,... print (solution containing exact elements that share the indexes in both the solution and puzzle)
Will this algorithm solve all Sudoku Puzzles in O log n time?