(revving machinery)…- [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 have 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 approached the problem,…
Visit other courses in the series to see how to solve the exact same challenges in languages like C#, C++, PHP, Python, and Ruby.
Skill Level Intermediate
1. Problem 1: Pond Oreille
2. Problem 2: Where Am I?
3. Problem 3: Eight Queens
4. Problem 4: Accessing Peripherals
5. Problem 5: Facial Recognition
6. Problem 6: Real-Time Information Dashboard
- Mark as unwatched
- Mark all as unwatched
Are you sure you want to mark all the videos in this course as unwatched?
This will not affect your course history, your reports, or your certificates of completion for this course.Cancel
Take notes with your new membership!
Type in the entry box, then click Enter to save your note.
1:30Press on any video thumbnail to jump immediately to the timecode shown.
Notes are saved with you account but can also be exported as plain text, MS Word, PDF, Google Doc, or Evernote.