Intro: Eight queens

- [Instructor] Hello and welcome…to the third problem of the Code Clinic series.…This challenge is a computer science classic,…the Eight Queens.…It's an excellent example of the use of recursion,…subroutines, loops, and functions,…rather than using one large monolithic set of instructions.…In addition, because this is a classic problem proposed…in 1848,…it's already been solved…for almost every programming language ever created…and as a result, is a way to compare the advantages…and disadvantages of many approaches.…

The problem is simple,…start with a standard chess board,…and eight queens.…Place the eight queens on the board…so that no queens can attack each other.…If you've never played chess,…you'll need to understand…that a queen can attack by moving an unlimited number…of spaces horizontally, vertically, or diagonally.…This means that no two queens can share a column, row,…or diagonal line.…For the Eight Queens problem, there are 92 solutions.…

In the following videos, our authors will show you…how they approach the problem,…