(robotic sound) - Hello, and welcome to Code Clinic, my name is Ray Villalobos. Code Clinic is a course where a unique problem is introduced to a collection of lynda.com authors. In response, each author will create a solution using their programming language of choice. You can learn several things from Code Clinic: different approaches to solving a problem, the pros and cons of different languages, and some tips and tricks to incorporate into your own coding practices.
In this episode, we're working on a classic computer programming problem called, The Eight Queens. This famous problem is often used during interviews or to demonstrate the utility of a computer language. It requires an understanding of recursion, and algorithm design, and can be quite useful as an exercise in learning to program solutions for complex solutions. This problem was proposed by Max Bezel in 1848, and solved by Franz Nauck in 1850. The problem is simple, start with a chess board and eight queens, then set up the board so that no two queens can attack each other.
There's more than one solution, find them all. We already know that there are 92 possible solutions and we already have examples of the solutions in several computer languages. If you've never played chess, you'll need to understand that the queen can attack by moving an unlimited number of spaces in three directions: horizontally, vertically, and diagonally. This means that no two queens can share the same row or column, nor can they be located diagonally from each other. In the following video, I'll show you my solution to The Eight Queens Problem.
I encourage you to also look at the solutions from other authors in the library. You'll be able to compare different author styles and different languages.
Visit other courses in the series to see how to solve the exact same challenges in languages like C++, C#, Java, PHP, Python, R, Ruby, and Swift.
Skill Level Intermediate
1. Problem One - Exploring Lake Pend Oreille
2. Problem Two: Image Analysis
3. Problem Three: Eight Queens
4. Problem Four: Accessing Peripherals
5. Problem 5 - Recursion and Directories
6. Problem 6 - Building the Web
- Mark as unwatched
- Mark all as unwatched
Are you sure you want to mark all the videos in this course as unwatched?
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.