7

Is there an algebraic way to know In which square two diagonals meet?

For example a2 and f3 meet in d5

How can one find d5 without looking at the board? (Blindfolded chess exercise)

3
  • 2
    Are you asking for a mathematical formula or an easy way for a human to visualize it?
    – Minot
    Commented Sep 22, 2021 at 17:11
  • Both ways are good, the easier the better.
    – Dasem
    Commented Sep 22, 2021 at 18:14
  • Any given square (except the corners) has two diagonals, so giving the squares is usually not enough (this has been raised by Philip Roe in the answers). Commented Sep 23, 2021 at 6:30

6 Answers 6

9

The math formula is relatively easy (intersection of two straight lines, even with fixed slant), but I assure you I can visualize it much faster on the board than solving it, even if I'm a lousy visualizer!

  • Replace the letters with numbers: 12 / 63 \ (These are x,y coordinates)
  • 12 is the upward diagonal (you didn't specify but it's obvious)
  • Since it is upward, its equation is y-x=2-1
  • 63 is the downward diagonal
  • Since it is downward, its equation is y+x=6+3
  • Solve it in your head (add/subtract to eliminate)
  • Solution is x=4, y=5
  • Revert x to letter: The answer is "d5"
3
  • Thanks for the answer, one more question about what you said, i find it hard to visualize the intersection, i know f3 for example ends on a8 and that a2 ends on g8 but visualizing the intersection is hard, so do you have some special method to visualize or it just something that comes with practice and experience? Currently i don't see a real way to solve it except the algebraic method you provided.
    – Dasem
    Commented Sep 22, 2021 at 18:12
  • 1
    @Dasem: Definitely practice. In any case, why not start small? Visualize a 2*2 board. Then 4*4. What color is g5 on a chess board? Visualize just the white officers in the starting position. And so on. BTW, a third method is simply counting up: a2,b3,c4,d5,e6.../f3,e4,d5. Found. Commented Sep 22, 2021 at 19:38
  • I know the colors of the squares that is pretty easy with the aid of a small technic, i also tought about counting up but it a bit slower and sometimes confusing because of the comparison to the other line of squares, sometimes one can miss a square or need to start over the counting and because of that to loose time, but i didn't practice it much. And yes i will practice my visualization in various ways as general improvement, but currently i will stick to the algebraic way as my main method for finding intersections. @Hauke Reddmann.
    – Dasem
    Commented Sep 22, 2021 at 20:34
11

Actually the accepted answer is not correct. Where do the diagonals from a4 and g4 intersect? There are two solutions, d7 and d1. It is easy to modify @Hauke Reddmann's algebra, but it seems to me much easier (and more useful) to try and improve your visualization.

1
  • 3
    This is not an answer and should be a comment.
    – Florian F
    Commented Sep 24, 2021 at 13:34
6

As many others have pointed out, the best idea is to learn to visualise the board better.

But since there is a neat mathematical answer, let's start by converting the letter coordinates to numbers, with A=1, B=2 etc. Then:

(TL;DR:) Take the sum of coordinates of one square, and the difference of coordinates of the other, and find the square that matches both.

Just in case that seems a bit too terse:

There are two diagonals through every square. One of these diagonals preserves the sum of the coordinates, the other preserves the difference.

So, to find the squares reachable diagonally from both a2 and f3, you first convert them into coordinate number pairs:

  • a2 = (1,2)
  • f3 = (6,3)

and then into sum-difference pairs:

  • a2 = (1,2) -> (sum 3, difference -1)
  • f3 = (6,3) -> (sum 9, difference 3)

Since you have to take a diagonal in a different direction (and thus, preserve a different quantity) from each square, you get the intersection points by taking the coordinate sum of one square, and the coordinate difference of the other. In this case, they are

  • intersection 1 = (sum 3, difference 3)
  • intersection 2 = (sum 9, difference -1)

You can then convert these back to coordinate pairs and then regular coordinates by a little mental arithmetic:

  • intersection 1 = (sum 3, difference 3) -> (3,0) = off board
  • intersection 2 = (sum 9, difference -1) -> (4,5) = d5

And that right there is the answer.

This all looks a lot more difficult than it actually is, because in the real world, we wouldn't try to find both intersections at once, like we did above. Instead we'd just calculate

  • "a2 adds up to 3, f3 has difference 3, so we need (3,0), oops, that's off board"

and then

  • "f3 adds up to 9, a2 has difference -1, so we need (4,5), ok, that's d5".

Special cases: If you ended up with an intersection point that has an odd sum and an even difference (or vice versa), your original squares were of different colours, and of course there is no integer solution to the last step.

Also, if you got the same coordinate sum (or the same coordinate difference) for both of the squares, then the process will give you the two original squares as the result. This means your two squares were on the same diagonal already.

PS. In case you're wondering how one might come up with this kind of idea, this process is actually just a coordinate system switch. We start with the regular orthogonal coordinates, then switch to defining the location each square by the two diagonals it's on. In this coordinate system the original problem is really easy to solve, and then we convert the result(s) back to normal coordinates again.

1
  • Very good i will use this, thanks.
    – Dasem
    Commented Sep 23, 2021 at 22:18
2

Sum letter and digit, using A=1, B=2, ...

  • A2: 1+2 = 3
  • F3: 6+3 = 9

The difference is 6. It is even, so intersections exist.
Half of the difference is 3. That is the delta.

To find the 2 intersections:

  • A2 has smaller sum => add 3 (the delta) to A and to 2. A+3, 2+3 = D5.
  • F3 has larger sum => subtract 3 from F and 3. F-3, 3-3 = C0.
    In that case it is outside of the board.

A special case is when both squares share a diagonal. You can detect that case when the sums are equal or when interections you find match the original squares. If not, you are good.

1
  • Very good, another great and simple method, thanks.
    – Dasem
    Commented Sep 24, 2021 at 16:28
0

X = (x1 + x2 + y2 - y1)/2 and Y = X + y1 - x1 Using this formula, we can calculate intersecting square of any two squares on chess board.

for example: a2 > (1, 2) and f3 > (6, 3) [assuming x co-ordinate a =1, b=2, c=3....f=6, g=7, h=8]

Note: You should always consider the left side point (square) as to be the first point So, X = (1+6+3-2)/2 = (10-2)/2 = 8/2 = 4 and Y = 4+2-1 = 5 As, X=4 and Y=5 The intersecting square is d5

Another thing to mention is that, if you don't get a positive integer (whole number, not fractions) as the X value, it means these two square doesn't intersect at all. That will happen only when you take two different colored squares.

0

First step: check if both squares are white or black, Write a2 as (1,2), then 1 + 2 is odd hence a2 is white Write f3 as (6,3), then 6 + 3 is odd hence f3 is white

Now, the squares on the diagonal (1,2) are the squares with a difference of 1 (a, a + 1) (and in more general the upright diagonal from (a,b) are those with difference |b-a|. For the squares on the diagonals (6,3), these are the upright squares with a difference of 3 (we can clearly ignore these) or the going upleft we subtract from the first coordinate and add to the second.

This quickly gives (6,3) --> (5,4) --> (4,5)! bingo! Or even faster, note that their sum, 9, stays the same for an upleft diagonal! Hence we need (a, a+1) with a + a + 1 = 9.

More generally, the upright or downleft diagonals will be easy (some set difference) and the upleft or downright diagonals has a constant sum.

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.