Chess with Maths

Sort:
Atharv8849
Ashvath23 wrote:
Atharv8849 wrote:

Many people might think what is use of that but in reality software engineer need such calculations

Yes!

Hello ashvath

Nice to meet my all friends after long time

Mr_Mathematician
Optimissed wrote:

I spent 5 months in India when I was 24 years old, which is very nearly 50 years ago. I spent my 25th birthday climbing a snow peak in thick mist. It was only a small one, about 16000 feet.

Anyway, in that time I learned to understand some of the ways that Indian people express themselves. The way that question was phrased was probably difficult for many Westerners to understand. The idea was "how many different ways can you place a white queen and a black queen on a board in such a way that the two queens do not attack each other?" So you have to work it out for one of the queens and then you double it to cover both queens. The closer you place one queen towards the centre of the board, the less positions there are where you can place the other queen and it isn't attacked. In fact, for each square nearer the centre that you place the first queen, the number of positions you can place the second queen decreases by two, showing that a queen becomes more powerful, the nearer it gets to the centre of the board.

I didn't know any of this before I saw this question yesterday but I worked it all out in about ten minutes.

Yes sequence start to observe when queens coming closure to the middle board

Mr_Mathematician
Optimissed wrote:
Wind wrote:
Mr_Mathematician wrote:
Wind wrote:

I've always tried to do this on a chessboard but never could!

At max I could put 7 queens not attacking each other, 8 is very hard.

Yet, very surprised that there are 42 ways 🤯

I think you misunderstood the question , there are only two queens on board

Oops! Indeed, I thought it was 8 queens.

Still surprised that there are only 42 ways, very nice!

No, you misunderstood in more ways than one . The answer is 5152 ways.

Well we have coordinates system in chess board if they do not exist( assume hypothetical) then some of the places becomes equally likely then the answer may vary since if you reverse the board you already counted that part which you considered on your opposite side.

Mr_Mathematician
Optimissed wrote:

He's a professional mathematician who works in engineering but he was on about maybe designing a chess engine to help him with his programming skills, so maybe he probably did think about it.

He will definitely come up with great new developing skills

We can also see amazing probability concepts here like if one follows book more the chess analyser tell us about winning chances we can also calculate it since there are more than 10^ 20 total games combination we humans can't do perfectly

Mr_Mathematician
StockOfHey wrote:

Because I forgot that the position of the queen is repeated on calculation... I therefore conclude that the answer must have an additional of 64*(3-1) = 128

2448+128 = 2576?...

Thank You for saying that I am wrong Ashvath23... without you, I made a mistake...

Then, I forgot the other queen... Thanks for optimissed... I must correct myself again...

2576*2 = 5152?

Congrats to you and your efforts friend 👏 💛

Mr_Mathematician
Atharv8849 wrote:
Ashvath23 wrote:
Atharv8849 wrote:

Many people might think what is use of that but in reality software engineer need such calculations

Yes!

Hello ashvath

Nice to meet my all friends after long time

Hello bro

MARattigan
Mr_Mathematician wrote:
...  more than 10^ 20 total games combination we humans can't do perfectly

Just a few more, Mr. Mathematician.

Mr_Mathematician
Optimissed wrote:
Mr_Mathematician wrote:
Optimissed wrote:

He's a professional mathematician who works in engineering but he was on about maybe designing a chess engine to help him with his programming skills, so maybe he probably did think about it.

He will definitely come up with great new developing skills

We can also see amazing probability concepts here like if one follows book more the chess analyser tell us about winning chances we can also calculate it since there are more than 10^ 20 total games combination we humans can't do perfectly

I've been involved in a thread here about "is chess a draw?" Well yes it is but did you know that to analyse chess completely with a modern computer would probably take longer than the present age of the universe? And that there's nowhere to store the results? According to my wife, my son's very happy in his new job. He just came up with a model that explains something that hasn't been done before and they like him. Can't say what that something is.

Basically in physics there is a principle called Heisenberg uncertainty principle this same thing gets applied to all which are related to uncertainty and I think everything in this universe is uncertain.

The probability arises where uncertainty occurs thats why we go take help of statistics in analyzing games / patterns/ chances etc.

MARattigan
Optimissed wrote:

There are 42 ways the Qs can be placed with the white Q on a1. There are 42 ways if the white Q is on a4. If the white Q is on f4, there are 38. Logically, for all the edge squares there are 42. If on b7 there are 40, so a pattern is developing. If we divide the board into concentric tracks, the outer track contains squares all of which are 42. The next track inwards 40, the next track inwards, 38.

The final track is the centre four squares. Taking one at random, d4, there are 5x6 +6 = 36

So we have 4x36 + 12x38 + 20x40 + 28x42 = 2576

Double it and we have the answer.

5152

Double it and we have the answer.

You do if you allow the queens to be the same colour. You need to halve it for each of WW and BB because in those cases you will have double counted, so 2576.(1+½+½) in total. 

All depends if two queens of the same colour can ever get to cancel each other if they're on the same row or diagonal. (Search me.)

If they can't you need to add in 4x27 + 12x25 + 20x23 + 28x21 = 1348, so 6500 in total.

GumboStu

I don't understand why the solution is to calculate for one Queen and then double it. Surely if one Queen can take the other then the reverse is also true. So doubling is just repeating positions already calculated?

MARattigan
GumboStu wrote:

I don't understand why the solution is to calculate for one Queen and then double it. Surely if one Queen can take the other then the reverse is also true. So doubling is just repeating positions already calculated?

True, but the queens can be WB, WW or BB. 2576 is correct for WB but double counted for WW and BB. So the total for queens not on the same row or diagonal is double that. If you take the view that opposite coloured queens can cancel each other if they're on the same row or diagonal but same coloured queens can't ever cancel each other then the answer is 6500 as above.

If the question is about only the WB case doubling is incorrect and the answer would be 2576.

@magipi articulated the difficulty.

GumboStu
MARattigan wrote:

True, but the queens can be WB, WW or BB. 2576 is correct for WB but double counted for WW and BB. So the total for queens not on the same row or diagonal is double that. If you take the view that opposite coloured queens can cancel each other if they're on the same row or diagonal but same coloured queens can't ever cancel each other then the answer is 6500 as above.

If the question is about only the WB case doubling is incorrect and the answer would be 2576.

@magipi hit the nail on the head.

AH I see. Thank you. I had in mind only one pair of Queens at a time and assumed WB

MARattigan

I suspect so did @Optimissed, but maths is not his strong point.

Aviral_10_3

Nice to see you after long time

Mr_Mathematician
Aviral_10_3 wrote:

Nice to see you after long time

😊

StockOfHey

In how many ways two queens shall be placed into 8×8 chessboard such that they never get cancel by each other ( there are only two queens on board place , assume white plays first ).

The question have a unique word indeed... it says cancel by each other... I find it vague because if a piece capture another piece, the piece that capture the other piece remain on the board... It also say that white plays first, so it is still using a rule in chess which is turn based... If both of these things do not meet in the same rules, which should we trust?...

The answer might be sad... But, if I think more about it, it does not make sense...

If the riddler clarifies things for us, we might get the better look at it...

Is it just about capturing stuff?

Wind
StockOfHey wrote:

In how many ways two queens shall be placed into 8×8 chessboard such that they never get cancel by each other ( there are only two queens on board place , assume white plays first ).

The question have a unique word indeed... it says cancel by each other... I find it vague because if a piece capture another piece, the piece that capture the other piece remain on the board... It also say that white plays first, so it is still using a rule in chess which is turn based... If both of these things do not meet in the same rules, which should we trust?...

The answer might be sad... But, if I think more about it, it does not make sense...

If the riddler clarifies things for us, we might get the better look at it...

Is it just about capturing stuff?

They can't be in the way of each other.

StockOfHey

I also do not understand it myself? Is it just a mistake? Or it is made on purpose?

StockOfHey

If I think more about it... A queen that cannot be captured by the other can remain on the square controlled by other... Is it just a glitch?

StockOfHey

Is statistics also says that extreme things can also happen no matter how small they are?