tournament

问题 I am in the process of converting my Tournament Organizer software, which allows the creation and manipulation of Double Elimination Tournaments, to use the MVVM design pattern so that it can be more easily tested. In doing so, I'm separating out the 'model' from some code in the UI that directly manipulates the bracket structure. This will be the third iteration of software I've written to handle tournaments. The first was written in PHP and stored the data in a database. The second version

问题 I am in the process of converting my Tournament Organizer software, which allows the creation and manipulation of Double Elimination Tournaments, to use the MVVM design pattern so that it can be more easily tested. In doing so, I'm separating out the 'model' from some code in the UI that directly manipulates the bracket structure. This will be the third iteration of software I've written to handle tournaments. The first was written in PHP and stored the data in a database. The second version

问题 I've been experimenting with MongoDB in order to move some parts of an app to it. I'm thinking a document-based db like mongodb would be a nice fit for tournament brackets but I'm having sort of a hard time coming up with a suitable model. (still trying to break free from RDBMS dogma) Anyone have any ideas for a good way to model Single AND Double-elimination tournament brackets? 回答1: Both tournament variation basically come down to each match either resulting in one of these options : Player

问题 I need to draw a tournament bracket in Android. I already calculated the positions for all games (i.e. an (x,y) tuple that defines where to place teams in a spreadsheet-like structure). However, I don't know the preferred way of drawing the bracket. I found an example that shows what I need:Example My first idea was to programmatically create and fill a TableLayout . However, borders are not really supported and a lot of TextView s are needed to fill the space between games. So I am not sure

问题 I need an algorithm that can take any number of match-ups like you can see below and group them by round evenly with each participate in it once if possible. I generated the match-ups below by round for 8 and 3 teams. I am having issues filling up my rounds and being left with an orphan game that cant go in the last round. Now the rounds are arbitrary but as you can tell each participate can be found in each round (1,2,3,4,5,6,7,8). Now these matchups can be deleted or added, and sorted

问题 Closed . This question needs to be more focused. It is not currently accepting answers. Want to improve this question? Update the question so it focuses on one problem only by editing this post. Closed 5 years ago . If you're not familiar with what I mean by tournament bracket, see here: http://baseballguru.com/bracket1.gif That said, I have built the dataset and figured out the number of rounds (ceil(log($numPlayers,2))) and I am comfortable finding the number of players in each round, etc.

问题 Given a list of opponent seeds (for example seeds 1 to 16), I'm trying to write an algorithm that will result in the top seed playing the lowest seed in that round, the 2nd seed playing the 2nd-lowest seed, etc. Grouping 1 and 16, 2 and 15, etc. into "matches" is fairly easy, but I also need to make sure that the higher seed will play the lower seed in subsequent rounds. An example bracket with the correct placement: 1 vs 16 1 vs 8 8 vs 9 1 vs 4 4 vs 13 4 vs 5 5 vs 12 1 vs 2 2 vs 15 2 vs 7 7

问题 I'm building a system that will create a tournament based on a list of contenders. Contenders have properties that might make them not able to be placed in brackets with eachother, such as gender, weight, skill level, etc. In some cases this gets pretty complex: contender may go up one weight class, but never down Genders may be mixed under a certain age. What would be a good way to get these people into optimal brackets (for instance, sizes of 4, 8, 16)? Is there a known algorithm for this

问题 I have a round robin tournament where I create all the games necessary (7 games per participant) for 8 teams. I however need 10 games per participant which means I need to duplicate matchups, and on top of that 1 and 5 can't play each other. You can see from the data below the games I generated for each participant (# of games) in the order it was created which would be the round. I am trying to figure out the best possible way to duplicate the matchups and evently distribute the matchups in

问题 Assume we have following tree: 1 9 2 13 3 10 4 15 5 11 6 14 7 12 8 Where elements(matches): 1-8 is round 1 9-12 is round 2 13-14 is round 3 15 is round 4 How I can determinate round of element "n" in shuch tree? My current formulas are: total_rounds = floor(log(totalTeams,2)); matches_per_round = (totalTeams / pow(2, current_round)) next_match_id = (totalTeams/2) + ceil(match_id/2) total_matches = total_teams - 1 回答1: Imagine the tree was numbered in reverse. 15 7 14 3 13 6 12 1 11 5 10 2 9 4