Create a Sudoku Solver In Java In 20 Minutes - Full Tutorial
VloĆŸit
- Äas pĆidĂĄn 12. 05. 2021
- Complete Java course: codingwithjohn.thinkific.com/...
Source code here: www.codingwithjohn.com/sudoku...
Let's create a Sudoku solver in Java!
Sudoku is a logic game, where you fill in numbers from 1-9 in a 9x9 grid. In Sudoku, each row, column, and 3x3 sub-grid must contain all numbers from 1-9.
Solving Sudoku in Java seems like it could be complicated - and some of it certainly is! But I'll break down the Java program for solving Sudoku into more simple pieces that we'll code together.
Learn or improve your Java by watching it being coded live!
Hi, I'm John! I'm a Lead Java Software Engineer and I've been in the programming industry for more than a decade. I love sharing what I've learned over the years in a way that's understandable for all levels of Java developers.
Let me know what else you'd like to see!
Links to any stuff in this description are affiliate links, so if you buy a product through those links I may earn a small commission.
đ THE best book to learn Java, Effective Java by Joshua Bloch
amzn.to/36AfdUu
đ One of my favorite programming books, Clean Code by Robert Martin
amzn.to/3GTPVhf
đ§ Or get the audio version of Clean Code for FREE here with an Audible free trial
www.audibletrial.com/johnclean...
đ„ïžStanding desk brand I use for recording (get a code for $30 off through this link!)
bit.ly/3QPNGko
đčPhone I use for recording:
amzn.to/3HepYJu
đïžMicrophone I use (classy, I know):
amzn.to/3AYGdbz
Donate with PayPal (Thank you so much!)
www.paypal.com/donate/?hosted...
âComplete Java course:
codingwithjohn.thinkific.com/...
codingwithjohn.com
Making a sudoku solver was actually the very first project I programmed once I'd learned the basics. This takes me back.
Wow ! I have been coding for arround 5 years and could'nt come up with a solution!
@@yahia1355 oh I didn't do anything smart. I literally brute forced a solution. Basically going over every single square and trying the first number that works, then if I got to one that had no possible correct number I would go back until the first square that I could have put a different number in and tried the different number. Do that until you can fill every square correctly. Just literally trying every combination until it works. There are much better ways to solve this. But the not so smart solution works.
@@19joni69 đ€Łđ€Łđ
You're an excellent teacher, John. I find your videos not only extremely helpful, but impressively well-made - and it's not even so much about the format (which is ideal), but the way you teach and the examples you give. You explain things in a logical, progressive way, and you're excellent at providing the right level of exposure. I do wish there were more teachers like you in universities - but then, we might not have you on CZcams ;) Please keep going with these tutorials, you are contributing to the community in a huge way.
This was, legitimately, the most interesting java tutorial I've seen in years! EXCELLENT!!!!!
I'm so glad channels like this one exist. It was a part of my project and I would've never figured that out myself...
I had recently discovered this channel, haha, and I started to watch your videos on TV Like I am watching some movies or some kind of entertainment, nice videos keep it up, subscribed after watching 2-3 videos
Same)
This program works perfectly. What a flawless algorithm you have written .
Thank you! Amazing video, where I work I tried several times create something to solve our work schedule with some kind of algorithm but always fail, this was just exactly what I needed and hope to solve my needs. Thank you!
very nicely explained John, I saw few other videos as well for Sudoku Solver, but this is amazing!
Itâs beautiful when something thatâs educational is also entertaining
This is the best video I found online for this problem. You are a great teacher, thank you.
It was just really awesome and in so nice way u described it's just really wow... M so surprised why just so less likes I have watched couple of videos before but u just explained really understanding with gotcha learn some new concept as well successfully found my final year project as well thanks for making this video... I will surely check out your more videos.. Great job đ
This is excellent .. i simply love the naming conventions of the vars..which makes its easy to read and understand the logic
Sir before I watch your video I was a student who was struggling to solve recursion problems for my upcoming test. Now I get the idea about how to backtrack in recursion :) Huge thanks from South Korean student!
I didn't think this solution would have an adequate time complexity. Thanks!
This was such a good explanation!!! I feel a lot more confident about implementing this. Also thanks for not acting like this is easy/obviousđ
it is amazing to see various algorithms that be used to solve sudoku, i made one but using while loop
Great coding John! I got a "Hard Sudoku" solved in a few ms !
This is exactly what I was looking for to complement my java studies. Projects with step-by-step explained.
Please, keep it going, unfortunately here on CZcams, everything seems to be only JavaScript or Python. It would be great more projects with OOP.
Your explanaition is soo cool! You even make feel this stuff is easy.
You just nailed it. Mind blowing tutorial, no doubt.
Great explanation and great mini project
Thank you so much. Looking for more project like this
No wonder youâre a lead! Very clear sir, thank you
cool project :) i'm fairly new to java, i programmed a small snake'ish game, so i understood the 2d array way better then i thought :D keep up the good work!
OMG, I understand how to solve this complex problem now. Thank you so much!
Simply Nailed It, AWESOME EXPLANATION
This was really nice, fun and informative!
Great video, your explanation was pretty clear!
Great video! Thanks for this kind of tutorials John! :D
Awesome, exactly the kind of CZcams channel I wanted:
Regularly uploaded coding videos.
Great video, I really enjoyed your explanation. Super thanks, this was very helpful
Thanks so much John. I spent a lot of time searching on youtube for a good tutorial on this. I wish yours was the first video so i could have saved time :(
Amazing! Thanks for this, this helps me stay engaged in java
This tutorial is excellent John.
Great video John. Congrats on 500 subs!
Thanks!!
Well at least I've certainly gone well past 500
How did you make it so simple, I always appreciate your content. your content is limited on youtube but whenever I get stuck in any problem and you have a video on that, which means, my last destiny is your video. Thank you
Hey, John I loved the way you went forward with explaining the video , you made it quite easy to learn the algorithm and fun too, i was curious if we can attach some image recognition tools like OpenCV etc for Java , so that we can scan a sudoku at run time and give an image back? I would love if you could show us how to do this if you like the idea.
I wrote a Sudoku solver in 2008 in Javascript, but it didn't quite use full recursion (my mistake) so it wouldn't solve moderately difficult puzzles. Mine includes character recognition of uploaded websuduko puzzles. This week I added "paste from clipboard" so that I didn't have to save/load my puzzle images. Today, following your model I finally got mine solving even the "evil" puzzles. Thank You John for this great lesson. Although now I don't feel that "I wrote the code", my page works and I did right the optical character recognition parts. I don't believe that I can share a link here, but I can try.
Watching couple of videos from this channel every day in any order. But still makes sense
Hi John, i have learned a lot from your videos. I hope you won't stop making videos in upcoming days, it is really helpful for us.
I can guarantee you will get a huge subscribers in coming days.
Thanks! Glad you're getting something out of them. I'll keep making them if people keep watching them!
I have reached the part where I didn't find a solution to erase the all the numbers of the board and to retry. I know it needed some recursion, but didn't figure out how. Your explanation was excellent and after reviewing your method, everything makes sense. Thanks and keep it up with these kind of videos!
Well explained!
Thanks John
I like what you doing, Hope you get the chance to do Dijkstraâs algorithm, Time complexity and a few more interview related.
I like your explanations
Thanks for the great explanation! Keep it up with the channel!
Great explanation, easy to understand, even for beginners :-) Thanks!
Gr8 vid. Spent the last 2days working on this really breaking it down. I got a lot outta following and really understanding whatâs going on here. Keep them comingâŠđđżđđż
Beautifully well explained, thank you sir.
Loved your explanation..keep it up buddy đ
In an intro to programming textbook I own, it mentions in the preface that one difference from prior printings is that it removes the sudoku solver example code from the multidimensional arrays chapter because apparently is it too complex at that point.
Just one word for John đđŒ
Big ThankYou âŁïž
WOW.. you are amazing....clean.. detailed.. explanation.
Please do Leetcode problems also.. It will help us.
I like that you also play binding of issac đ.
As for the program I loved it. It was well made video for beginners and one can't not understand the concept. Keep it up! đ
As always, thank you John.
Loved this!
Very nice. I do this stuff for fun. Recently did one of those word search generators which you see kids books all the time. Way more interesting to do than you may initially think.
Now I can solve it by myself, thanks a lot.
Wow! Thatâs so cool! This was an awesome video! Very interesting :)
its fantastic, i really like the way you teach, its intresting! However, could we do it using DP or is the an NP?
Bro, thank you for teaching. You are the go to guy!
Excellent explanation đđđ
Iâd love to see this exact algorithm but more efficient. Knuths Algorithm X for sudoku sounds very interesting and shows a pretty good method for backtracking. Iâm too dumb to understand how to implement it in java but it could be a cool challenge for you.
Fantastic video and fantastic channel, your videos are great thanks .
Awesome Tutorial
Fantastic stuff!
Wow sir you can explain things very well, let aside being multitasker.
That was fantastic. Thanks đ
Dude, thanks a lot!! You saved me
Very interesting tutorial!
John, thank you for everything! Could you maybe make a video on backtracking specificaly? That would be awesome! :)
Really helpful!
You teaching skills are really impressive, great work! I have one minor point to critique, you hardcoded GRID_SIZE 9 but used 3 as a magic number. You could have computed it once sqrt(GRID_SIZE) or just declared it as a constant.
sqrt(GRID_SIZE) would make no sense at all
@@Michael-se7ny Really? Doesn't a Sudoku box always have side length of sqrt(GRID_SIZE)? But I guess the really clean way would be to define the sudoku in terms of the BOX_SIZE, since GRID_SIZE has to be square number.
so a normal sudoku is BOX_SIZE = 3. (GRID_SIZE = BOX_SIZE * BOX_SIZE)
@@JannisAdmek right
Using static methods and passing the board as parameter hurts my brain for some reason
(vs using the board as an instance of a class)
same! Why doesnt he use the board as an instance? Is there any special reason for this?
I think that those nested for loops on the solve method are unecesary, you could add two additional params to send the current row and column and inside the function you just would need to either add the the rows or to the column depending on what you are doing... yes you will have to put some IF's, but the way you did it I think it will do unnecesary iterations, I mean, the last recursive call on a solvable board will put the needed number but there's nothing that would stop the initial call to the solve method from stopping it's iterations. Actually, on each recursive call it will have to traverse as far as possible on the board until sending back a false or a true if solved. You don't need the algorithm to traverse almost the whole board on each recursive call, you just need it to make a single step on the board instead.
Loved it! đ„
Great tutorial !
You make truly great videos
Fun way to learn about recursion đ
Wow! Sooo nice and free! Instant sub and hooked. Binge time.
I think, i just found my best youtuber. Keep up the good work John.
Same
Great and concise explanation! When this video was suggested, I found it hard to believe that this was doable in a beginner friendly way in only 20 minutes, well done!
I have one suggestion though: If you have the GRID_SIZE as a static final int, the box size (3, as used as a magic number in isNumberInBox(...) and print(...)) should be, too! Probably it should be initialized as the square root of GRID_SIZE, or vice versa.
wow,next level explanation
Awesome algorithm. It would be nice, if you could also explain the time complexity of the algorithm in your video.
I think we can use dynamic programming too, to reduce some of the complexity. We can use a HashMap to store if a number at particular position was a valid placement or not.
i guess this one is for beginners and that's why he chose this way of doing it
But that is dependent on the previous placements. So I do not immediately see how that improves this algorithm.
The argument of the hashmap needs to be both the board and the placement of the number. How does backtracking in your algorithm work? I am not sure how you intended to do it with hashmaps and make the code less complex than what you saw in this video. Can you elaborate further?
One idea popped up in my mind, but it is more or less a copy of what you saw in the video but without recursion. First you have an array which holds the position which are given in the beginning. Then, you proceed filling in the board and every time you find out that you can't continue filling in the board you backtrack the i and j variables of the loop until you reach the next number which you filled in and continue trying filling it after setting number To Try to be 1+the previous numberToTry.
iirc the whole problem is a system of linear equation , and u can solve it in O(n) if u use multigrid method
amazing professor!
such a enjoyable algorithm!!!
Hello John, why didn't you use TDD in this example? This could be a nice addition, because it constantly keeps the code in check
love this!
Awesome johnny...
Great explanation.
Will be great if we can also talk about the time complexity of the solutions
It's like O(k*10^(k^2 -n)) where k is the number of cells in a row and n is the number of placed numbers at the start.
If you try with k greaters than 9 this algorithm would literally take years to find a solution.
You can do better using sat solvers and translating the sudoko problem into cnf logical formulas.
@@robertoborelli3275 may I ask why do you have zero in the beginning of the expression 0(k * 10^(k^2 - n))
doesn't it just cancel everything to zero? Also, why do you have 10 to the power of cells to solve, how did you get 10? Did you mean k because with every added unsolved cell you need k times more traversing the loops (assuming that the number of rows = the number of digits you can fill a cell in) ? And why do you have k * in the beginning of the expression?
@@smrtfasizmu6161 it's been a while since I've watched the video and now I don't remember exactly the code but here I give you some explanations:
1) It's not a 0, but is a big O. This thing is called "Big O notation". Simplifying, you can read it as "the complexity is less or equal than..." but there are some formal and accurate mathematical definitions behind this intuition I gave.
2) The intuition behind the formula is that this code is clearly exponential in the number of unsolved cells (k^2 - n).
3) each time you call the function to see if a number is valid in cell you spend O(k) time.
4) For each cell there are (exactly) k possible values (in the case of normal sudoku k is 9).
So to sum the important thing here are:
- exponential in the number of unsolved cells.
- you take linear time in k, each time you check if a number is valid
So as I wrote in the previous comment this is a pretty easy solution to write and implement but it's very inefficient since it uses the technique 'guess and verify'.
It's much better (but also a bit more difficult) to use a sat solver for this kinds of problems.
Time complexity looks to be O(n^3) worst case. Average, eyeballing it, I would say is n^2*log(n)
â@@juanmalpartida1333 no. just because you have 3 nested loops you can't always say that you have O(n^3).
Inside this loop there is a recursion!
This solution is exponential for sure, infact there are situations in which you guessed j correct values, than you are trying to fill the j+1-th value and you discover that there is no such a solution. In this case the algorithm does "backtracking" and there are situations in which all the j guessed valuesare wrong and the algorithm must re guess the entire solution.
This leads to exponential cost!
Hi John, what should be the strategy to follow your tutorial. Shall we understand it first whole ? then we should code or should we code parallel ?
This is cool, thanks man
this is a quality tutorial
Please make a video on the Hand Of Poker (Poker Hands) Game, it seems to be used alot on interview assessments this days. I am sure alot of people need it.
it is 100% working teacher john and thank you for the source code
like your explain!!
very clear!!!!!
Awesome Explanation......does the time complexity is ignored here as we are looping for a constant no of elements
Great explanation! Why did we return not(!) of the three methods in method isValidPlacement?
Thank you very much!
Shit took me a while but I think that's why it was worth it. This video made recursion seem so much more intuitive. Thank you!
Its clever, I understood right away how it worked but the get to this simplicity is quite amazing. If it's you who found the solution then you're quite a clever man!
Amazing work!
Pretty nice explanation. I made one sudoku solver but try to improve his performance using a priotityQueue. Basically save in the queue the empty spaces that can take the minimun posible values, so.. the queue delivery the spaces that have less probablity to change... and i reorder the probability of the other spaces that have been afected for add a new number in ther matrix. This consume so much memory but less time...
Interesting methodology! This definitely isn't the most efficient way to do it but the board is limited to 9x9, so even with a terrible time complexity any board is still solved pretty quickly