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

• Find common elements in matrix rows

  2668 Solvers

• Given two arrays, find the maximum overlap

  1598 Solvers

• Too Many Zeros, Dump Them!

  249 Solvers

• Return fibonacci sequence do not use loop and condition

  688 Solvers

• Mass Conversion 2

  788 Solvers

More from this Author295

• Encrypt a message with the square root of 2

  3 Solvers

• Classify water surface profiles

  4 Solvers

• Determine whether a property description closes

  5 Solvers

• Compute the unitary totient of a number

  4 Solvers

• Convert integers from base 10 to proper primary notation

  3 Solvers