Queens are powerful in Chess

Logic Level 5

Find the maximum number of queens that can be placed in a 20 × 20 20 \times 20 chess board such that each of them attacks at-most 1 other queen.


The answer is 23.

Samara Simha Reddy by Samara Simha Reddy , 22, India

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Where each dot represents a Queen.

6 Helpful 0 Interesting 0 Brilliant 0 Confused

This problem at least from my point of view is pretty complicated and especially complicated if you try to come up with the principal understanding which can express and as such make explicit or articulate what is the actual reason for which it is impossible or possible to place a number of queens on the chessboard understanding which can be more or less abstract/concrete anyway.

For example , you showed it can be done with 23 queens but can you show that it can't be anyway done with more and therefore that 23 queens is indeed the maximum therefore elaborating in some form exactly that understanding to some sort of explicit expression and also another question which is somehow related to that understanding how you came up with the configuration anyway ?

A A - 4 years, 11 months ago

Log in to reply

Just a guess and some work.

Is there any other way of the configuration.

Samara Simha Reddy - 4 years, 11 months ago

Log in to reply

I think there can be but I can't give another one now anyway and would be interesting to calculate what are all those working configurations/"constructions" anyway.

I suppose that if you consider it's structure by taking into considerations the relations between the queens you can come to similar constructions. Yet it's still not sure if 23 is the maximum by this guess. As such , even if there are strong reasons to believe that 23 is the maximum they are never enough to be completely certain anyway but I will announce you if I come up with something complete regarding it and of course if you will come up with some sort of understanding like that of which I was speaking upper please do the same anyway.

A A - 4 years, 11 months ago

Log in to reply

@A A – If you are interested then try this problem .

Samara Simha Reddy - 4 years, 11 months ago

Log in to reply

@Samara Simha Reddy – Haha , I know that problem. I think I solved it though I have not introduce the answer and considering this problem that is a lot easier.

Oh , and thanks for the problems. And also , congratulations for your points even if I know you posted that problem for some time but anyway.

A A - 4 years, 11 months ago

Log in to reply

@A A – ⌣ ¨ \Large \ddot\smile .

Samara Simha Reddy - 4 years, 11 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...