Problem 54770. Count the peaceful queens

• Created by ChrisR
• Appears in 2 groups

×

By solving this problem, you will make progress in the following group(s)

Chess

• 18 Problems
• 4 Finishers

Sequences and Series VI

• 16 Problems
• 3 Finishers

Like (2)

Difficulty:

(47)

Rate

• Solve Later   
• Add To GroupÂ

In a 5x5 chessboard with a queen of one color (white, say) on the perimeter, one can place 12 black queens on the board such that none of the black queens can attack the white one (or vice versa).

Write a function that returns the number of queens that cannot attack a queen of the other color placed anywhere on the perimeter of an nxn chessboard.

Solve

Solution Stats

65.14% Correct | 34.86% Incorrect

• 109 Solutions
• 64 Solvers

Last Solution submitted on Jan 24, 2025

Last 200 Solutions

Solution Comments

ANNOUNCEMENT ×

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Hello Community, We're excited to announce that registration is now open for the...

Problem Recent Solvers64

Suggested Problems

• Sum of series III

  1517 Solvers

• Flip the vector from right to left

  9585 Solvers

• Mersenne Primes vs. All Primes

  723 Solvers

• Convert from Fahrenheit to Celsius

  25132 Solvers

• Potential energy calculation

  2116 Solvers

More from this Author297

• Compute the Lagarias Riemann Hypothesis sequence

  5 Solvers

• List numbers such that every sum of consecutive positive integers ending in those numbers is composite

  7 Solvers

• Determine flows of given probability using empirical frequency analysis

  5 Solvers

• Compute an integral of an exponential function

  4 Solvers

• Compute the effective conductivity of a heterogeneous aquifer

  12 Solvers