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
Continue this lesson in the app
Install CourseHive on Android or iOS to keep learning while you move.