Start learning with our library of video tutorials taught by experts. Get started
Viewers: in countries Watching now:
Many successful programmers know more than just a computer language. They also know how to think about solving problems. They use "computational thinking": breaking a problem down into segments that lend themselves to technical solutions. Code Clinic is a series of six courses where lynda.com authors solve the same problems using different programming languages. Here, Kevin Skoglund works with Ruby.
Each month, Kevin will introduce a new challenge and provide an overview of his solution in Ruby, explaining how he broke the problem up into logical components, and revealing the difficulties he encountered. Challenges will include topics such as statistical analysis, searching directories for images, and accessing peripheral devices.
Visit other courses in the series to see how to solve the exact same challenge in languages like C#, C++, Java, PHP, and Python. And check back every month for new challenges.
- [Voiceover] Hello and welcome to Code Clinic. My name is Kevin Skoglund. Code Clinic is a monthly 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. This month 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 problems. This problem was first proposed by Max Bezzel 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 is more than one solution. We want to find them all. We already know that there are 92 possible solutions, and we already have examples of the solutions in many computer languages.
If you'd never played chess you'll first need to understand that a 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 a row or a column nor can they be located diagonally from each other. In the following videos I'll show you my solution to the Eight Queens problem. If you want to try to create your own solution first, I'm going to begin by giving you some tips that can help you out.
Find answers to the most frequently asked questions about Code Clinic: Ruby .
Here are the FAQs that matched your search "" :
Sorry, there are no matches for your search "" —to search again, type in another word or phrase and click search.
Access exercise files from a button right under the course name.
Search within course videos and transcripts, and jump right to the results.
Remove icons showing you already watched videos if you want to start over.
Make the video wide, narrow, full-screen, or pop the player out of the page into its own window.
Click on text in the transcript to jump to that spot in the video. As the video plays, the relevant spot in the transcript will be highlighted.
Your file was successfully uploaded.