I have a bit of a math question for a Sol Lewitt sort of project. Say I have a 4x4 grid with 16 possible positions and 4 points that can each fill one of those positions at a time. I want to systematically determine all of the unique permutations of the positioning of the 4 points. I think I could probably work this out with some for loops, but I'm not sure how to screen for translation and rotation. I think it's best if I explain this visually:
xooo ooox
oxoo ooxo
ooxo oxoo
ooox should not be unique from xooo as it represents the same shape translated around the center axis. Similarly,
ooox should not be unique from xooo as it represents the same shape translated around the center axis. Similarly,
xxoo ooxx
xxoo ooxx
oooo oooo
oooo should not be unique from oooo as it was simply translated two positions to the right.
Additionally, I would be interested in any reading on these types of problems that only requires elementary math.
Thanks!
Zach
1