I'm attempting to create an equation to represent the amount of possible tile configurations in the board game Carcassonne. In this game, there is a number of square tiles (4 sides) with 3 different possible things that could exist on each side (City(C), Field(F), and Road(R)).
In order to figure out how many total tile combinations exist, it's relatively easy to list out each possible combination (i.e. CCCC, CCCF, CCFF, CFFF, ect.), so I know there is 24 total tile possibilities in the base game. however, I'm looking to create my own version of this game, but with more sides and more things to be on the sides (i.e. hexagonal tiles with 5 different "biomes").
I saw someone's very complicated math on the subject a while ago, and I've been unable to find it again, so i'm wondering if i could get some help on the issue.
Thanks for any help!
In order to figure out how many total tile combinations exist, it's relatively easy to list out each possible combination (i.e. CCCC, CCCF, CCFF, CFFF, ect.), so I know there is 24 total tile possibilities in the base game. however, I'm looking to create my own version of this game, but with more sides and more things to be on the sides (i.e. hexagonal tiles with 5 different "biomes").
I saw someone's very complicated math on the subject a while ago, and I've been unable to find it again, so i'm wondering if i could get some help on the issue.
Thanks for any help!
Last edited by a moderator: