An work colleague from a prior job, thinking I must be some kind of math genius, posed this question:
Do you happen to come up with a generalized formula up to n- dimensions (it wouldn’t need to be with letters necessarily).
Obviously I see the progression here but my question on how to express more graciously for any general case.
I fiddled with it and replied:
For the 2D case you can let $x=(a,b)$ then you have
It’s ugly and doesn’t look like anything. Context?
Its the solution from 2D to 4D (and extrapolated, to $n$-dimensions) of the following problem: Assume you want to establish how many possibilities there are to count $k$ successive elements in a 2D (or nD Grid).
Do you remember the kids game “Connect Four”? Well, that’s an example of this problem, how many ways are there to count 4 elements adjacent to each other (horizontally, vertically and in diagonals) in a 6 x 7 grid or lattice.
in 2D and are the respective solutions in each dimension: Given a grid of times and you want elements, and (in other words this is the number possible solutions in each row and column; the are the ones which correspond to all the diagonals.
I think there has to be an elegant solution to it (in terms of a nice formula), but as I said, it can be easily be extended into higher dimensions.
For Connect4 I found a few references:
- Connect 4 mathematical solution
- How many Connect 4 games are there?
- Number of legal 7 X 6 Connect-Four positions after n plies
Beyond that, I’m not seduced by this kind of problem and/or don’t have the skills or aptitude.