N Queens Problem in Python (Recursive Backtracking)

Hi! In this video, we shall be solving the n-queens problem using Python. We shall employ an algorithm called Recursive Backtracking to solve this problem. Leave your questions in the comments. Smash like and hit the subscribe button! GitHub link for the code: https://github.com/ChipTalksComputers/Knight-s_Tour_Python/blob/main/n_queens.py Time-stamps: 0:00 - Introduction 1:37 - Taking input 1:59 - Getting the board 2:31 - Print Board 2:43 - Checking if a cell is Safe 3:48 - Recursive backtracking 5:35 - Calling the functions SUBSCRIBE NOW: https://www.youtube.com/channel/UCzwshHkHUhKFuYkvuTy5VAw GITHUB: https://github.com/ChipTalksComputers FACEBOOK: https://www.facebook.com/Chiptalkscomputers-105731584427042/ INSTAGRAM: https://www.instagram.com/chiptalkscomputers/ PYTHON FOR BEGINNERS: https://www.youtube.com/watch?v=f3UQPPIUO3I&list=PLvPkQguCZ7Msp52PoEmZfmLVhlJzQA9DJ PREVIOUS VIDEOS: Voice Chat application: https://youtu.be/dqV62qNnI4I Chat application: https://youtu.be/8HmKhRMlt6c Tags: n queens problem chess