Backtracking Explained - Solving N-Queens and Knight's Tour using Python

If you want to send me a tip. You absolutely don't have to!
Etherium: 0xae6b07d67301d4f5aed36254b19f05cc593732cb

[mr_tpk]

Thank you dude. Your video is short and to the point. 🎉❤

[MikePlus]

Me: Mom can we get Code Bullet?
Mom: We have Code Bullet at home
Code Bullet at Home:

[brunopereira]

Such a compat video man, really liked it!!

[Leaf-zc]

I do understand the thinking of the algorithm and the code is amazing. But I am quite confused that why the board metric could change during the function 'solve'. As it is a parameter for the function which the return is a bool variable True or False. Why would the argument 'board' be changed during the running of function? I am curious.

[RossieVina]

good day, what are the other backtracking algorithm that i may use to solve the local maxima of the steepest ascent hill climb? instead of using the depth-first search, can you suggest another backtracking?

[claraaralc]

Thanks for this video - very informative. Why do you return True and not False if the counter is above 64? Should this not end the loop as the maximum number of moves has been reached?

[thepaleify]

greetings,
in the knight tour example, how did we choose the 3, 2 as the starting point? i mean shouldn't we iterate through the starting points as well?
thanks in advance

[thomtee]

nice one, but the "n" in your solve function is not needed..it doesn't appear anywhere!

[tyboro]

how would you implement this for sudoku

[Soheyl]

Why do you choose this music for this video?
Are you teaching how to use a sword?

[AverageIQtakes]

does this find a path for every starting point

[dominicdellasera]

Do you have a background in math or comp sci. Love the vid.

[peteryakubu]

do you remember how long your knight's tour algorithm took