you can speed the process up with symmetry. rotating the board doesnt change if the solution is valid. therefore when youre done checking a square youre also done checking 4 other squares. eg: you start on h8, when the recursion falls back you have also checked for a8, a1, h1. there are no other symmetries because you are litterally filtering them out in the first place, so only speed up by 4. but its really easy to implement.
Alrite, it is time now for me to play again , the smart one. I was imagining some study in the recent past of my unemploied nobody here but I dont know if it really works nor how well, if it does doing anything more like it. Inspired by the Jacobi technique to solve aproximatively for linear eqs systems we might try iteratve , high precisons yet polynomial order complexty, to compute , in the end of the algo running, the whole amount of the number of solutions for some 20 per 20 board for the N-queens problem. But , as a knowing rule on these computers, nothing gets too easy. :-) And the most important, congratulations for Your work here!
Animations with PowerPoint and for the last animation (process when n=5) I made it with Python by generating an image for each state of the board during the process then sticking them to make a video
So suprised to see that you have only 20k subscribers.The content is too good.
Thank you so much 😀
The best explanation I've ever seen. Thank you very much❤
you can speed the process up with symmetry. rotating the board doesnt change if the solution is valid. therefore when youre done checking a square youre also done checking 4 other squares. eg: you start on h8, when the recursion falls back you have also checked for a8, a1, h1. there are no other symmetries because you are litterally filtering them out in the first place, so only speed up by 4. but its really easy to implement.
correct if im wrong, in rec() during each recursion the nb_solution becomes zero and it mess up the solution
This is amazing. Specially the visual presentation and how you explained in details.
Thanks a lot!
💯 🔥 So greatly done in explaining and animation. Thanks 🙌
You're welcome!
Couldn't have come at a better time. Follow you on Udemy but didn't find this problem there
Many thanks for posting it !
You're welcome!
your videos deserve more views
Brilliant explanation = thank you so much🥰
In the case 1 the complexity should be nPr not nCr as we need to arrange n queens on n^2 space
But the order of queens doesn't matter
Alrite, it is time now for me to play again , the smart one. I was imagining some study in the recent past of my unemploied nobody here but I dont know if it really works nor how well, if it does doing anything more like it. Inspired by the Jacobi technique to solve aproximatively for linear eqs systems we might try iteratve , high precisons yet polynomial order complexty, to compute , in the end of the algo running, the whole amount of the number of solutions for some 20 per 20 board for the N-queens problem. But , as a knowing rule on these computers, nothing gets too easy. :-) And the most important, congratulations for Your work here!
What tools are used to create animations and simulations?
This is great. Keep going! 💖💖❤❤
Animations with PowerPoint and for the last animation (process when n=5) I made it with Python by generating an image for each state of the board during the process then sticking them to make a video
@@insidecode There is a lot of work. Awesome.
Great programming channel... maybe speed it up 1.25 x and add background music and then you are there
great animation . Thank you
You're welcome!
bro thank you for this amazing video
You're welcome!
Garcia Anthony Thompson Elizabeth Brown Steven