1 min readOct 20, 2019
Thanks, In brute force, there would be a total of 9^x permutations, where x is no of blank positions. It won't be fast. And the motive of this project is to test whether neural nets can solve the sudoku.
Thanks, In brute force, there would be a total of 9^x permutations, where x is no of blank positions. It won't be fast. And the motive of this project is to test whether neural nets can solve the sudoku.
Machine Learning Engineer | Available for consultancy | shivajbd@gmail.com