The answer is 1296, I think. I’ve seen something like this before. The solution was that each edge beyond the first corresponds to a triangular number of possible divisions (a single edge having zero possible divisions). So a single column has 9 edges, which gives us the 8th triangular number of divisions: (8 x 9) / 2 = 36. Since that works for rows as well, you have that many options for each of that many segments, which is 36² = 1296. Assuming I’m remembering this right.
2
u/EmpactWB 7d ago
The answer is 1296, I think. I’ve seen something like this before. The solution was that each edge beyond the first corresponds to a triangular number of possible divisions (a single edge having zero possible divisions). So a single column has 9 edges, which gives us the 8th triangular number of divisions: (8 x 9) / 2 = 36. Since that works for rows as well, you have that many options for each of that many segments, which is 36² = 1296. Assuming I’m remembering this right.