- It is an easy problem, if you know the answer.
- Given a square matrix of NxN ordinary numbers.
- Initially place N identical indistinguishable castles or rooks (chess pieces) on the main diagonal.
- Then keep swapping any two rows or columns to exhaustively enumerate all possible unique patterns of castle formation.
- Not a single castle in any of these formations should be under threat of any other castle,
- only one castle watches over an otherwise empty row and column.
- For each pattern, find the product of all numbers covered by the castles.
- If this pattern was obtained after even number (0,2,4,...) of swaps,
- then add the product to an initially empty accumulator,
- otherwise subtract the product from the accumulator.
- Give the final expected value of the accumulator,
- does not matter whether by hook or by crook,
- but please give a general solution,
- the test suite may be modified soon.
Solution Stats
Problem Comments
4 Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers226
Suggested Problems
-
388 Solvers
-
Project Euler: Problem 4, Palindromic numbers
1266 Solvers
-
431 Solvers
-
Cell Counting: How Many Draws?
2384 Solvers
-
ベクトル [1 2 3 4 5 6 7 8 9 10] の作成
598 Solvers
More from this Author99
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
??? kannitverstan
points 3 and 4 are not clear. Can you explain what is meant by castle here? probably a visualization may help better understand the picture in this problem
@Zuha Altaf "castle" here means a rook, as in the chess piece; the given (square) matrix is also interpreted as an NxN chessboard.
@Christian Schröder, this clears the picture a little, thankyou for your explanation.