User Name: Password:
New User Registration
Moderator: Hrqls , coan.net , rod03801 
 BrainKing.com

Board for everybody who is interested in BrainKing itself, its structure, features and future.

If you experience connection or speed problems with BrainKing, please visit Host Tracker and check "BrainKing.com" accessibility from various sites around the world. It may answer whether an issue is caused by BrainKing itself or your local network (or ISP provider).

World Of Chess And Variants (videos from BrainKing): YouTube
Chess blog: LookIntoChess.com


List of discussion boards
Mode: Everyone can post
Search in posts:  

15. August 2014, 10:58:03
rabbitoid 
All rubbish. There's no need for a time-check. Here's a 2-cent algorithm:
- when any game ends, check if it is in a tournament. If not, we're done.
- if yes, check it's section for winner
- if there is a clear-cut winner for this section, check if all sections are done.

How to "check this section for winner":
- Find the highest score
- for all the other players in the section:
- - assume that all the unfinished games for the player will be wins.
- - if the new assumed score is higher than the "highest score" the section is not over.
- if for all the other players in the section the test is good, the section is over.

This algorithm costs almost nothing in performance. 3 "for" loops and a couple of ifs.
Why won't it work? because there's no one to implement it.

Date and time
Friends online
Favourite boards
Fellowships
Tip of the day
Copyright © 2002 - 2024 Filip Rachunek, all rights reserved.
Back to the top