The video was easy to follow and the bit at the end was nice to see the function working step by step to show the concept of backtracking. You definitely worked super hard on this video. well done
Great minimal coding using recursion. And animation is real added bonus. The video itself is a good example in its own class to emulate by other educators perhaps.
I found myself spending days on this - it feels so disappointing! Is this normal?? I got to try solve it(did not finish) in a longer approach too, probably inefficient - i feel defeated! I did not use backtracking. I seem to get confused with recursion every time despite having lots of experience! Is this normal? Is it possible to come up with this solution from the get go in 5 minutes if one has never done it before? Thank you for sharing this video - it's been very well explained - + 1 like and subscribe.
I enjoied very much watching the video. I think that some other solution type, may try breath first strategy, and also, simply to complex coroborating techniques to produce the next breath first aproximation of all pissiblities for any cell to be filled with digits, that is also meant to find, in the end, the unique solution, if the algo work properly. :-)
Sorry for my english language mistakes, first, and second, yes, my idea that I put above may need more memory than the one occupied by the sudoku array itself, kinda bigger order complexity mem amount needed, compared to the sudoku board. >
WOW. I always expected making a Sudoku solver to be insanely complicated, but clearly not. I actually suck at solving Sudokus, but I'm planning on making a Sudoku solver for a school project, and this is perfect. I didn't expect to understand anything at all when I clicked on this video. I'm really surprised how easy this seems. I hope it is how it seems 🤞
I love you! no homo. Best explanation I have ever seen. It allowed me to organize my thoughts. Other instructors make it more complicated than what it is.
I always wondered if we can succesfully test some rating 1400 chess program based on limited hardware processing power and some software idea that I would formulate it as progressive complexity breath first alpha beta prunning also stable kinda search/ stable first minimax search, breifly. Thank You! :-)
@@insidecode Thanks but if the grid is printed after the function is called grid is still the same unsolved one, but if printed with in the function just before returning False solved one is printed, so how to use the result?