Skip to content

greenturtle1134/chess-optimization

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

10 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

chess-optimization

This app is designed to find the best way to pair players in a round-robin tournament. It maximizes the number of games being played simultaneously. It does this by representing the current state of the tournament as a graph with players as nodes and unplayed games as edges, and uses Edmonds' Blossom Algorithm to find the maximum cardinality matching over this graph.

How to use

Click "create new" or the name of the file you want to open.

If creating a new file, enter a name for the file.

Then enter the names of the participants. Names can have spaces.

The main window displays the current results of the tournament as a grid.

  • Yellow indicates a match yet to be played.
  • Blue indicates a match in progress.
  • Green indicates a match already played.
  • Red indicates a match that cannot be played for some reason.
  • The "present/absent" buttons mark a player as present or absent. Absent players will not be matched into games.
  • The bottom of the window shows the next pair to match in the optimal setup. This pairing is also marked with a dashed blue box.
  • Click "accept" to automatically mark it as in progress.
  • Click "reject" to mark this pairing as impossible.
  • The optimal pairing should automatically update. If it does not, click "update".

Click on a square to manually mark a game being played, or the result of a game.

The data is saved in a file within the same folder as the program with name tournmament_NAME.txt.

About

Program to run chess competitions

Resources

License

Stars

Watchers

Forks

Packages

No packages published

Languages