Hey, and thanks for reading in advance. This question likely pertains to permutations and combinatorics - fair warning. Might get a little dicey.
I’m applying the finishing touches to a map made for a PVP-fighting game I’m making alongside some others. In the center of the map, there is a rotating dais with 4 symbols - each one representing the game’s class categories. Each symbol is currently ‘pointing’ to a generator on the wall across from it that corresponds to the same class category as the symbol.
Let’s say, for the sake of clarity, that the current config is:
Assassins (North), Marksmen (East), Spellcasters (South), Brawlers (West).
The idea is, when a player using a class belonging to a generator’s category attacks that generator, it will power it up. When fully powered, if the dais is then rotated (in 90 degree increments either CW or CCW) such that the symbol matching that generator is pointing towards it, every player using a class belonging to that category will be powered up temporarily.
That having been said, the current configuration of the symbols is such that each one is already pointing at its respective generator - I’d like to mix them up so that for any given rotation, no more than two matches exist. I’m certain it is possible neither practically nor mathematically to have a configuration where each rotation has only one non-repeating match, so I can settle for between 0 - 2.
Any ideas for potential configurations would be appreciated. Thanks for bearing with me if you read this far.