Backtracking Competition Scheduler

This project implements a backtracking algorithm to generate valid competition schedules under multiple constraints.

Problem

Given a set of clubs grouped by country, the goal is to construct a valid match schedule while satisfying:

• Each club plays a fixed number of matches
• Balanced home/away distribution
• Restrictions on matches between clubs from the same country
• No conflicts within the same round

Approach

The solution uses:

• Backtracking to explore possible match combinations
• Constraint checking to prune invalid branches early
• State tracking per club and per country

This reduces the search space significantly and allows efficient generation of valid schedules.

Features

• Constraint-based scheduling
• Backtracking with pruning
• Modular design using classes (Club, Land)
• Handles multiple constraints simultaneously

Tech Stack

• C++

How to Run

Compile using the provided Makefile:

make

## Run the program
./Competitie

## Notes

This project was originally developed in a private university GitLab environment (LIACS).  
The commit history here is limited because the project was later migrated to GitHub.

The focus of this repository is to showcase the final implementation and functionality.