#more realistic metrics could be substituted here, but ID can be used for this example #the winner of the match become the next entry in the nextround list #compare the 1st entry in the list to the 2nd entry in the list Print "- starting a new round of games -" #if a new round begins, reset the list of the next round If gameid in : #this is a manual decision tree, doesn't scale at all #In a single elim tournament with a full field, # of games is # of teams-1 # this doesnt easily scale to 32, 64, 128 entries Suggestions? # this list represents the round 1 seeding order on the tournament sheet The "primary key" that I need to retain is the "seed id" (1-16, in this case), which matches the unique identifier in the database, so that I can pull the correct metrics for deciding which entry will win a matchup. ![]() So far this is the best I have come up with, but it doesn't scale (at all easily) to 32, 64, 128 entries & so-on. I've already got a database that I plan to connect to to get the metrics, but I am hoping to find a better way to "process" games in the tournament to move the winner to the next round, and eventually find the tournament winner. ![]() The idea would be to insert some meaningful metrics to determine the winner. I'm learning python and I want to model a single elimination tournament like they use in athletic events like tennis, basketball, etc.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |