Place N Queens

Talk it through with a coach who asks guiding questions and gives hints until you reach the answer. Pass to mark the challenge as completed.

The problem

  • hard
  • Pro

Place n chess queens on an n by n board so that no two attack each other, and count how many such arrangements exist. Explain how you prune the search.

Talk this problem through with an AI coach

This is a Pro challenge. Sign in with Google, then upgrade to start a voice session.

Start free →