How to master the N queens problem using recursive backtracking
In short: Can you arrange queens on a chessboard so that none can attack another? This video explores a systematic solution to the N queens problem.
In this lecture from MIT's 6.S095 Programming for the Puzzled, Professor Srini Devadas demonstrates how to solve the N queens problem. While the classic 8 queens problem is a well-known challenge, the video details a more general approach for any N by utilizing a recursive backtracking search.
Opens the Intellect+ feed with this card first. Swipe up for the next one.
Sources
- Summary by Intellect · source: Puzzle 6: A Profusion of Queens
To cite this card, link to https://intellectplus.co.uk/app/ideas-puzzle-6-a-profusion-of-queens.
How we source, check and correct cards: Editorial standards.
General information, not professional advice. Spotted an error? Flag the card or see corrections and complaints.
Intellect Plus is a visual educational discovery platform for exploring fascinating facts and ideas. Brain Food, Not Brain Rot. What is Intellect Plus?
