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

Github: github.com/challengingLuck/yo...
Click here or I will steal your cookies: bit.ly/2Z1uzKM
If you want to send me a tip. You absolutely don't have to!
Etherium: 0xae6b07d67301d4f5aed36254b19f05cc593732cb
Music: www.bensound.com

[@mr_tpk]

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

[@brunopereira9905]

Such a compat video man, really liked it!!

[@ChallengingLuck]

Thanks for the comment.

[@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?

[@ChallengingLuck]

In the 8x8 case 64 is the maximum number of moves. Should have changed it to N to generalize it.

[@MikePlus]

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

[@ChallengingLuck]

Even copying his upload schedule

[@user-bo3xo8dy5h]

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.

[@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

[@ChallengingLuck]

Depends on the approach!

[@dominicdellasera7397]

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

[@ChallengingLuck]

I do!

[@nataliialebid]

thank you for this video

[@ChallengingLuck]

My pleasure! Thank you for the comment.

[@FelTContreras]

Great video, appreciate UWU

[@ChallengingLuck]

Thank you so much.

[@thomtee]

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

[@ChallengingLuck]

That’s true. In the knights tour it would take long to solve an 8x8. Didn’t even want to try the 16x16. That’s why I changed my mind mid way and didn’t even include n.

[@tyboro2275]

how would you implement this for sudoku

[@ChallengingLuck]

That's for you to find out, isn't it

[@samuel__14]

Great videos

[@ChallengingLuck]

Thanks!

[@carltang___6346]

does this find a path for every starting point

[@ChallengingLuck]

yep

[@alired9189]

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

[@ChallengingLuck]

lol

[@peteryakubu3434]

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

[@ChallengingLuck]

A few seconds I believe. The code is linked here. You can just try running it.

[@danielosorioorozco5214]

I will post my algorithm based in backtracking + restrictions to solve sudokus in python: github.com/dogia/sudoku_solver

[@ChallengingLuck]

Very clean! Good job