Användarnamn: Lösenord:
Registrering av Ny Användare
Moderator: rod03801 
 Feature requests

Do you miss something on BrainKing.com and would you like to see it here? Post your request into this board!
If there is a more specific board for the request, (i.e. game rule changes etc) then it should be posted and discussed on that specific board.

For further information about Feature Requests, please visit this link on the Brainking.Info site : http://brainking.info/archives/20-About-feature-requests.html


Förteckning över diskussionsforum
Läge: Alla kan skriva
Söka bland inlägg:  

26. mars 2007, 23:02:03
grenv 
Ämne: Re: Removing tournament hand-brakes
Ändrat av grenv (26. mars 2007, 23:03:31)
AbigailII: Ok, I kind of meant that without being clear. so i see further down in the thread you describe an algorithm that works for the simple case.
So if T=W+D/2 for the leader, and T(n)=W+D/2+U for the others for simplicity

So if you are searching to see if T > T(n) for all n

If it doesn't then you need to see if T=Tn for each value of n. If it does then you would just search through a tree to determine if any combination of results ends up with the leaders S-B score being less than the challengers. That's what I meant by being efficient. You don't need to take into account every possible outcome.

Datum och tid
Vänner online
Favoritforum
Vängrupper
Dagens tips
Copyright © 2002 - 2024 Filip Rachunek, all rights reserved.
Tillbaka till sidans början