Skip to main content
Admissions guidance, study banks, and career tools — get started on Shalyam
Shalyam
Sign in Get started

N-Queens Solution Count

Hard Constraint Search Problems
Log in to solve

Print the number of ways to place n queens on an n x n board so that none attack each other.

Constraints

1 <= n <= 12

Discussion

No discussions yet.

Rewards · v2.1

Get Exclusive Insights with Every Issue

Join Shalyam Newsletter

Stay ahead in education, research, and innovation—straight to your inbox.