Chess Sudoku

I have a great idea: Chess Soduku. Rules below:

Rules:

On every rank there must be 2 white pieces and 2 black pieces.

On every file there must be 2 white pieces and 2 black pieces.

No piece can threaten another of another color.

All pieces must be used.

No pawns allowed on the 1st or 8th ranks

Feel free to try! Post commented diagrams below.

I think it would be hard and fun

does it really work??

Interesting idea!

Don't know. I havn't sucseeded yet. Maybe someone will! Consider it a chalenge, and feel free to show others

It's not possible. You can't threaten another piece. That means queens and rooks need to be blocked by their own pieces. But you're only allowed two pieces of a color in each row, so you've got to block one side with the edge and the other with a piece. That's true for both rows and columns, so queens and rooks need to go in corners. But there are a total of six rooks and queens, and only four corners, therefore it's impossible.

I hope that makes sense.

Ignores the "all pieces must be used" rule, missing a few rows and columns but beautiful nevertheless.

Good reasoning TheronG. It can't work!

Inspired by Haggard-CC.

I've been trying to find a way to get 2 knights of each color into each row and each column without threatening each other, but I can't get it to work  Anyone know if it's possible?

logozar

I think something went wrong with your quote, I'm not sure what you mean. I know it's impossible to do what was suggested in the original post, but is it possible to do it with knights?

So it is possible. 

Is it possible with all pieces?

If not lets see how close we can get

Queens don't work, because they are too powerful. Nice idea still, logozar.

Therefore, perhaps we can make a rule that all pieces except a Queen or a rook.

Wait...I made a big blunder:

Oh sorry, I forgto that there must be only two white pieces and two black pieces in a rank.

But let's check mathematically:

There are 32 pieces.

There are 64 squares. Is it possible for there to be just 4 pieces on each rank and on each file?

No.

Yes it is.

As I wrote in my next post.

Anyway, this doesn't seem possible mathematically. Not that I am giving up.