Nareau
Explorer
If you haven't played Carcassonne, it's a little like dominoes in that you lay down tiles that have to match up edge-to-edge.
Each tile has 4 sides, and each side can have 3 different "features": A road, city, or meadow (R, C, or M).
I think this is a pretty simple permutation problem, but there's a twist in it. If you read the sides of the tile in a clockwise fashion, you might get: Road, Road, Road, City.
RRRC is the same as RRCR, RCRR, CRRR because the sides wrap around.
But a tile that is CCRR is not the same as CRCR.
Am I overthinking (or underthinking) this? Can someone help me figure out how many possible different tiles there could be?
Nareau
Each tile has 4 sides, and each side can have 3 different "features": A road, city, or meadow (R, C, or M).
I think this is a pretty simple permutation problem, but there's a twist in it. If you read the sides of the tile in a clockwise fashion, you might get: Road, Road, Road, City.
RRRC is the same as RRCR, RCRR, CRRR because the sides wrap around.
But a tile that is CCRR is not the same as CRCR.
Am I overthinking (or underthinking) this? Can someone help me figure out how many possible different tiles there could be?
Nareau