if you connect any 4 squares on a chessboard you will get a rectangle.
There are 64 squares on a chessboard.
Can you finish from there?
this thread. (Scroll down a bit since there was a little issue with formatting to begin with. In particular, look at awkward's post.)
SpringFan25's response in this thread is also good, if I'm interpreting properly. You would have to keep in mind that the four squares you connect are not necessarily distinct, and must be arranged such that the top two squares define a row, as do the bottom two squares, and same with left and right defining columns.
Then again, maybe SpringFan25 was suggesting and there is some interpretation issue going on.
no its not, i wasn't paying attention sorry.
Assuming it still counts as a rectangle if its 1 chess square wide, You can get every possible rectangle by choosing 2 (distinct) squares to be the opposite diagonal edges.
there are 64C2 ways to do that (i think).
Add 64 if the 1x1 "rectangle" counts as a solution.
The correct answer is .
Look at the diagram. There nine vertical lattice points on the left edge and nine horizontal lattice points on the bottom edge. By choosing two points from each set we get a rectangle. (Yes squares are rectangles.)
Algebraic chess notation). Your method can be adjusted as follows.