Solving the N-Queens Problem - The Easiest Algorithm

In this video we attempt to solve the N-Queens Problem using a super simple and effective algorithm. You will see how a few simple optimizations drastically improve the running time of the algorithm. How many queens can we place without conflicts?

The algorithm and optimizations made in this video should help you become a better programmer.

The plotting and visualization program is written in C# using Unity.

Chapters:
0:00 - Introduction
0:30 - What is the N-Queens Problem?
1:16 - The Algorithm
2:45 - Tricky States
3:32 - 8-Queens Problem
4:24 - 25-Queens Problem
4:35 - 100-Queens Problem
5:23 - Conflict Counting
6:37 - Faster Conflict Counting
7:30 - 250-Queens Problem
8:11 - 500-Queens Problem
8:51 - Even Faster Conflict Counting
9:57 - 500-Queens Problem Improvement
10:08 - 1000-Queens Problem
10:41 - Optimization Trick
11:04 - 1000-Queens Problem Improvement
11:21 - 10000-Queens Problem
11:55 - 100000-Queens Problem
12:12 - Thanks!