Darn. The 3 examples I had got finished by now lol.
Basically, if several games are done in a group, and #1 and #2 go through to the next round, and player 4 still has 2 games going, but even if he wins those games he can't get the points total of #2, the system could calculate that and advance #1 and #2 to the next round. Right?
show me the money, not hypotheticals :)
http://www.chess.com/tournament/under-1600-challenge
Only one game left and the result will not affect the points being given out. Even if the lower player wins they will not move up a spot due to tiebreak.
http://www.chess.com/tournament/drmarko-open
Two games left neither game affects meaningful standings.
Neither of these are multi-round tournaments so it is no big deal if it takes a while to conclude, but thought I'd give you these to look at for your coding.
Here's a tournament that I'm in right now that the round is completely decided but there are still games going on...
http://www.chess.com/tournament/epiphany-13
The two games left are between the 6,7,and 8th place players out of a group of 10 where only first place advances...
Also this tournament...
http://www.chess.com/tournament/the-spring-special
Sadly even if I win the last game of the group it won't affect the decision on what will happen in the group. The winner is already decided.
something has to be offered where the tourney does not take so long .chess.com is ready to start its 7th tourney and the 1st is still not done. probably was started 2 years ago.maybe someone should have a no vacation tourney.
Both of these are in the same tourney and neither will change the outcome. In the first, both are out of the running. In the second, no matter who wins the leader moves up (I think).
http://www.chess.com/echess/game.html?id=13710235
http://www.chess.com/echess/game.html?id=13710302
This tournament has alot of games left but its obvious who won the tourny.., and no one else can even come close to him, im second no matter what and i'm behind by 3 points.
http://www.chess.com/tournament/faster-without-timeout
http://www.chess.com/tournament/5th-chesscom-tournament-1601-1800 consists of three remaining games for round one. None of these games would put the winner closer than two points behind the group winner. The game that recently finished wasn't relevant either since the group 71 winner was already decided. The best the other guy could've done was half a point behind. Games still in progress below.
http://www.chess.com/echess/game.html?id=11643167
http://www.chess.com/echess/game.html?id=11643516
http://www.chess.com/echess/game.html?id=11643508
Is there a way to get an algorithm that can look at the results in a group and determine when someone has "clinched" the group? Two of these games are being played in a group where the soon to be group winner won all 8 games.
group 1 is certainly still in question!
hrmm... ok. i see a few scenarios here. but many of the mentioned events are simply NOT done and have critical games in progress.
hrmm....
Really not a big deal imo... it's correspondence chess.
At the same time surely there's a way jsut to move on once the key places have been 'clinched' ... again, I've never given it much thought. Certainly have no 'examples' for you, I haven't checked!
I tend to agree that this would only provide benefit in a very small percentage of tournaments.
I know I've lobbied for it before in a couple of threads, and I'm not going to rehash all of the arguments here, but I'm wondering if there's any will to implement additional time-controls in turn-based chess that would provide more certainty with respect to the maximum length of a game (i.e. game level clocks in addition to per-move clocks)? I personally feel that this is where the most value can be had with respect to speeding up tournaments.
Don't think of it as a tournament-level issue, think of it as a section-level issue.
The algorithm is pretty simple: Any player's potential score = their current score + # of games they still have in progress. if player_1's current score > potential score of all other players in the section, player_1 has won the section. If you have two players advancing, once player_1 & player_2 have current score > potential score of anyone else in the section, both of them advance.
Once all sections have their winner(s), the next round can begin.
I think it would be better to have an option for the TD to request that process to be undertaken if he/she notices that a few inconsequential games are holding up the tournament.
It seems like it would take a lot less resources that way. I know in the one tournament I'm directing there are a few pools that have games going on that don't effect the result of the winner of the pool, but there are still pools with games that do have an effect so you can only wait.
Group #2 in:
http://www.chess.com/tournament/one-for-the-doctor
could have its outcome decided without waiting for the rest of the games.
This tournament has alot of games left but its obvious who won the tourny.., and no one else can even come close to him, im second no matter what and i'm behind by 3 points.
this is a great example. many vacations if i remember correctly and people moving as slowly as possible--which as i read today i discover is quite alright according to many members of this board. i don't get how people think it's cool to move at the absolute slowest possible pace becasue it's within the 1 move X number of days pre-set by the tournament. i can sit on chess.com for 2 days and 23 hours and not make a move as long as i move within the last hour. no matter how much i'm here, i'm not doing anything anyone should be able to question--pretty common belief 'round 'ere.
I don't think this thread is intended to rehash that argument for the Nth time. Keep it constructive.
I don't think this thread is intended to rehash that argument for the Nth time. Keep it constructive.
i'm not sure if you've directed this toward me but i think my comment is constructive. it shows some of the problems with lagging tournaments. if i'm not sticking to the true intention for this thread than i am sorry. i wasn't trying to derail i was trying to offer something to the discussion.
We get occassional request to speed up tournaments because of some lagging games. I would like to see specific examples right now of tournaments that are being help up by games that do not matter to the outcome of the round or entire tournament and that are delaying the inevitable. Once I see some of these I can start to construct an algorithm to find them.
You can look here: http://www.chess.com/tournaments/current_tournaments.html - some are SO close to finished :)
I looked at this one: http://www.chess.com/tournaments/pairings.html?id=31&round=3 . There are only 6 remaining games. But on closer inspection, this game has impact on the results: http://www.chess.com/echess/game.html?id=12319365
How do we programmatically find these tournaments help up "needlessly" so we can move them along? First check number of current games, and if less than, say 5, we run all possible outcomes of those games and the final results? My gut says there are just not that many events being help up needlessly...
so prove me wrong! :)