search

marceljuenemann / tiebreak

Calculation of various tournament tiebreaks
MIT License
2 stars 2 forks source link

Need support to develop more Tiebreaks ? #2

Open nicolasey opened 3 days ago

nicolasey commented 3 days ago

Hello @marceljuenemann !

I am a Chess referee and therefore (very) interested in what you do here. I have side-project to develop a UX-centric and efficient pairing engine using TypeScript (mostly)

Do you need help and contributions to go further on more tiebreaks, like for example:

  1. Nb victories
  2. Truncated buchholz (which seems to be logic continuation here)
  3. Performance before you go onto deeper project like sonneborn things ?

Thanks again !

marceljuenemann commented 3 days ago

Hey @nicolasey!

Thanks for reaching out and offering help! I'm curious how you came across this project, did you just find it on Google?

I already started working on Buchholz with Cut/Median and Sonneborn-Berger, but would certainly appreciate pull requests for other popular tiebreaks.

I doubt performance is a problem at all, but would be interseted in running a benchmark with a 1000 player tournament to measure. If it takes more than a few miliseconds, could probably just add a cache in the adjustedScore method to not keep recalcuating that.

You should reach out to @grosem as well, I'm sure he'd be very interested in your pairing engine as he's currently building a new tournament management system and there might be more room for collaboration.

Marcel

grosem commented 3 days ago

@nicolasey - sounds very interesting, we will reach out to you 😎