eightqueens_concepts - Solve a Problem

This site requires JavaScript. It looks like you have disabled JavaScript in your browser or are using a browser that does not support JavaScript. Please enable it or try another browser.

Ad Blocker Detected

You must disable your ad-blocking software for our web site in your browser to use this site. You don't have to turn off the ad blocker entirely; just disable ad blocking for codestepbystep.com, then refresh this page to continue.

It is easy to disable a tool like AdBlock for just one site while leaving it enabled for other sites. Just click the "stop sign" icon in the top-right of your browser, then un-check the "Enabled for this site" checkbox. If your UI doesn't match the screenshot below, you may want to Google for how to add a "whitelisted domain" to your ad blocker to allow ads from codestepbystep.com to be shown.

AdBlock disable screenshot

Thank you for your understanding and helping us to keep this service free of cost for all students to use.

Note: If you are seeing this message but aren't running an ad blocker or have disabled your ad blocker:

Try clearing your browser history and refreshing the page.
Make sure you don't have any other ad-blocking software running outside of your browser, such as a HOSTS file or proxy.
If you are using a school computer network: Many high schools have "proxy" software that blocks ads at the entire school level. Your school's system administrator may need to add an exception for codestepbystep.com to allow these ads to get through. You may need to copy/paste this information to your school's network administrator so that he/she can make appropriate changes to your network settings.

If you have questions or need any other assistance, please Contact Us.

Main Page → Exercises → Python → Solve an Exercise

Need help?

Stuck on an exercise? Contact your TA or instructor.

If something seems wrong with our site, please

Is there a problem? Contact us.

If an 8 Queens algorithm tried every possible square on the board for placing each queen, how many entries are there at the 8th and final level of its full decision tree?
(648) = 512 (8 * 8) = 16,777,216 (6464646464646464) = 4.72e21 (6463626160595857) = 1.78e14 infinity (order shuffled)
What does a better algorithm do to avoid having to explore so many possibilities?
Raise an error because the problem is too computationally expensive to solve. Compute all correct answers ahead of time and save them in a cache. Limit to placing only one queen in each column or row of the board. Randomly skip certain squares based on a heuristic. Use a dictionary to increase the efficiency of the algorithm. (order shuffled)
How do we make an 8 Queens exploration function that stops once it finds one solution to the problem?
Use a return statement to exit all recursive calls. Return a bool value of True when finding a solution, and checking for this in each call. Call the exit() function to quit the program after finding a solution. Print all solutions, but then erase the output to hide it. Raise an error if more than one solution prints out. (order shuffled)