Course Hive
Search

Welcome

Sign in or create your account

Continue with Google
or
Puzzle 6: A Profusion of Queens
Play lesson

MIT 6.S095 Programming for the Puzzled, January IAP 2018 - Puzzle 6: A Profusion of Queens

4.0 (3)
39 learners

What you'll learn

This course includes

  • 8 hours of video
  • Certificate of completion
  • Access on mobile and TV

Summary

Keywords

Full Transcript

MIT 6.S095 Programming for the Puzzled, IAP 2018 View the complete course: https://ocw.mit.edu/6-S095IAP18 Instructor: Srini Devadas Can you place N queens on a board with N columns and N rows so no two queens threaten each other? The 8 queens problem on a chessboard is a special case. Prof. Devadas describes a solution to the N queens problem that uses recursive backtracking seach. License: Creative Commons BY-NC-SA More information at https://ocw.mit.edu/terms More courses at https://ocw.mit.edu

Course Hive

Continue this lesson in the app

Install CourseHive on Android or iOS to keep learning while you move.

Related Courses

FAQs

Course Hive
Download CourseHive
Keep learning anywhere