YoVDO

N-Queens Problem Using Backtracking - Design and Analysis of Algorithms

Offered By: Sundeep Saradhi Kanthety via YouTube

Tags

Algorithm Design Courses Combinatorial Optimization Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Learn how to solve the N-Queens problem using backtracking in this comprehensive video tutorial. Explore the 4-Queens problem as a specific example to understand the backtracking algorithm's application in Design and Analysis of Algorithms (DAA). Gain insights into the step-by-step process of placing queens on a chessboard without threatening each other, and discover how backtracking efficiently finds solutions to this classic combinatorial problem.

Syllabus

N-Queens Problem using Backtracking || 4-Queens Problem || BACKTRACKING || DAA


Taught by

Sundeep Saradhi Kanthety

Related Courses

Natural Language Processing
Columbia University via Coursera Intro to Algorithms
Udacity Conception et mise en œuvre d'algorithmes.
École Polytechnique via Coursera Paradigms of Computer Programming
Université catholique de Louvain via edX Data Structures and Algorithm Design Part I | 数据结构与算法设计(上)
Tsinghua University via edX