It's not something egregiously esoteric, like "Number of cuboid solids that can be combined in n-dimensional space by drawing lines connecting their vertices" or something
@NathanMerrill it's really just asking what is the largest power in n... perfect squares get 2 (provided they aren't also a higher power), perfect cubes get 3 (provided...) and so on.
Hey if anyone has been wondering how beeswax works (the second hexagonal 2D language), M L added a fairly comprehensive explanation to his FizzBuzz solution: codegolf.stackexchange.com/a/67675/8478
@NathanMerrill Right. Are the games "someone wins and the others lose", or is it more like "someone wins, someone comes in second and someone comes in third"?
So would you start with 3 teams of 3 and one team of 2? Or would you just have 3 teams of 3 and the spare 2 don't play in the first round (safe from elimination)?
The greatest power...
code-golfnumber-theorysequence
Yeah, I'm still trying to come up with a better title...
A positive integer n is a perfect power of order k if it can be written in the form mk for some integer m. The greatest power of n is the largest number k for which n is a perfect powe...
@trichoplax I'm trying to design something that's flexible. So far, I don't know of any KoTHs that have elimination tournaments, but its certainly not unfeasible
@NathanMerrill I'm interested in this myself, particularly for the general case of more than 2 players per game. I'd like to make KotHs with an arena with many players, but if there are more players than can reasonably fit in one arena, it would need to be a tournament
Do you always want to favour N as the group size, with only one small group, or would you consider bringing the small group up to N-1 but reducing some of the other groups to N-1?
@NathanMerrill Doing something like 3 points for a win, 1 point for 2nd place, and 0 points for 3rd place seems like it would work. You wouldn't need to do a double-elimination, just play two rounds of shuffled teams and take the top X points to move on to the next stage.
I'm failing to see how. If someone wins twice, they'll have 6 points and will move on. If someone loses twice, they'll have 0 points and be eliminated.
So the tournament structure we're working on involves dividing into groups of N, and no one competes against anyone outside their own group, until next round when new groups of N are chosen from the survivors?
@PhiNotPi What would you recommend for a game played on an arena which can only handle N players, when there are more than N entries? Ideally I'd like something that gives an accurate order, without taking huge amounts of time.
@TimmyD Yes I'm still undecided on this. I'm trying to think of a way of telling whether there's a single best way, or whether it depends on the type of game.
The greatest power...
code-golfnumber-theorysequence
Yeah, I'm still trying to come up with a better title...
A positive integer n is a perfect power of order k if it can be written in the form mk for some integer m. The greatest power of n is the largest number k for which n is a perfect powe...
